Theoretical Computer Science

23

FOCS
1990
IEEE

115views Theoretical Computer Science» more FOCS 1990»

Algebraic Methods for Interactive Proof Systems

13 years 11 months ago

A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that every language in the polynomial-time hierarchy has an...

Carsten Lund, Lance Fortnow, Howard J. Karloff, No...

claim paper

Read More »

19

click to vote

FOCS
1990
IEEE

90views Theoretical Computer Science» more FOCS 1990»

Decision Problems for Propositional Linear Logic

13 years 11 months ago

Download www.csl.sri.com

Patrick Lincoln, John C. Mitchell, Andre Scedrov, ...

claim paper

Read More »

23

click to vote

FOCS
1990
IEEE

64views Theoretical Computer Science» more FOCS 1990»

Complexity of Unification in Free Groups and Free Semi-groups

13 years 11 months ago

Download www.ii.uni.wroc.pl

The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...

Antoni Koscielski, Leszek Pacholski

claim paper

Read More »

23

click to vote

FOCS
1990
IEEE

78views Theoretical Computer Science» more FOCS 1990»

Matrix Decomposition Problem Is Complete for the Average Case

13 years 11 months ago

Download research.microsoft.com

The first algebraic average-case complete problem is presented. It is arguably the simplest natural average-case complete problem to date.

Yuri Gurevich

claim paper

Read More »

23

click to vote

FOCS
1990
IEEE

63views Theoretical Computer Science» more FOCS 1990»

Security Preserving Amplification of Hardness

13 years 11 months ago

Download www.busim.ee.boun.edu.tr

Oded Goldreich, Russell Impagliazzo, Leonid A. Lev...

claim paper

Read More »

24

click to vote

FOCS
1990
IEEE

85views Theoretical Computer Science» more FOCS 1990»

Perfectly Secure Message Transmission

13 years 11 months ago

Download www.iacr.org

Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung

claim paper

Read More »

26

click to vote

FOCS
1990
IEEE

71views Theoretical Computer Science» more FOCS 1990»

On the Predictability of Coupled Automata: An Allegory about Chaos

13 years 11 months ago

Download math.ucsd.edu

We show a sharp dichotomy between systems of identical automata with a symmetric global control whose behavior is easy to predict, and those whose behavior is hard to predict. The...

Samuel R. Buss, Christos H. Papadimitriou, John N....

claim paper

Read More »

19

click to vote

FOCS
1990
IEEE

87views Theoretical Computer Science» more FOCS 1990»

Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain

13 years 11 months ago

Download www.cs.cmu.edu

Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...

Avrim Blum

claim paper

Read More »

8

click to vote

FOCS
1990
IEEE

66views Theoretical Computer Science» more FOCS 1990»

Randomness in Interactive Proofs

13 years 11 months ago

Download cseweb.ucsd.edu

Mihir Bellare, Oded Goldreich, Shafi Goldwasser

claim paper