STOC
1995
ACM
14 years 3 months ago
1995
ACM
We present a new class of asymptotically good, linear error-correcting codes. These codes can be both encoded and decoded in linear time. They can also be encoded by logarithmic-d...
STOC
1995
ACM
14 years 3 months ago
1995
ACM
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
STOC
1995
ACM
14 years 3 months ago
1995
ACM
This paper contributes tothe study of nonlinear dynamical systems from a computational perspective. These systems are inherently more powerful than their linear counterparts (such...
STOC
1995
ACM
14 years 3 months ago
1995
ACM
STOC
1995
ACM
14 years 3 months ago
1995
ACM
c communication case. This lemma generalizes and abstracts in a very clean form the ``round reduction'' techniques used in many previous lower bound proofs. ] 1998 Academ...
STOC
1995
ACM
14 years 3 months ago
1995
ACM
STOC
1995
ACM
14 years 3 months ago
1995
ACM
STOC
1995
ACM
14 years 3 months ago
1995
ACM
New probabilistic algorithms are presented for factoring univariate polynomials over finite fields. The algorithms factor a polynomial of
STOC
1995
ACM
14 years 3 months ago
1995
ACM
STOC
1995
ACM
14 years 3 months ago
1995
ACM
