Sciweavers

Share
FOCS
1990
IEEE
10 years 3 months ago
The Lattice Reduction Algorithm of Gauss: An Average Case Analysis
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
Brigitte Vallée, Philippe Flajolet
FOCS
1990
IEEE
10 years 3 months ago
IP=PSPACE
In [Sh92], Adi Shamir proved a complete characterization of the complexity class IP. He showed that when both randomization and interaction are allowed, the proofs that can be ver...
Adi Shamir
FOCS
1990
IEEE
10 years 3 months ago
The Computability and Complexity of Optical Beam Tracing
John H. Reif, J. D. Tygar, Akitoshi Yoshida
FOCS
1990
IEEE
10 years 3 months ago
Algebraic Methods for Interactive Proof Systems
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...
FOCS
1990
IEEE
10 years 3 months ago
Decision Problems for Propositional Linear Logic
Patrick Lincoln, John C. Mitchell, Andre Scedrov, ...
FOCS
1990
IEEE
10 years 3 months ago
Complexity of Unification in Free Groups and Free Semi-groups
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
FOCS
1990
IEEE
10 years 3 months ago
Matrix Decomposition Problem Is Complete for the Average Case
The first algebraic average-case complete problem is presented. It is arguably the simplest natural average-case complete problem to date.
Yuri Gurevich
FOCS
1990
IEEE
10 years 3 months ago
Security Preserving Amplification of Hardness
Oded Goldreich, Russell Impagliazzo, Leonid A. Lev...
FOCS
1990
IEEE
10 years 3 months ago
Perfectly Secure Message Transmission
Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung
books