STOC
1999
ACM
14 years 4 months ago
1999
ACM
This paper strengthens the low-error PCP characterization of NP, coming closer to the upper limit of the BGLR conjecture. Consider the task of verifying a witness for the membersh...
STOC
1999
ACM
14 years 4 months ago
1999
ACM
STOC
1999
ACM
14 years 4 months ago
1999
ACM
STOC
1999
ACM
14 years 4 months ago
1999
ACM
STOC
1999
ACM
14 years 4 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
STOC
1999
ACM
14 years 4 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...