FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
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...
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
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...
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
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...
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
The first algebraic average-case complete problem is presented. It is arguably the simplest natural average-case complete problem to date.
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE