Gap Amplification in PCPs Using Lazy Random Walks
Author:
- 1 January 2006
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 96-107
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Proof verification and the hardness of approximation problemsJournal of the ACM, 1998
- Probabilistic checking of proofsJournal of the ACM, 1998
- Interactive proofs and the hardness of approximating cliquesJournal of the ACM, 1996
- Checking computations in polylogarithmic time1991