Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
127
click to vote
FOCS
1998
IEEE
82
views
Theoretical Computer Science
»
more
FOCS 1998
»
A Tight Characterization of NP with 3 Query PCPs
15 years 7 months ago
Download
people.csail.mit.edu
It is known that there exists a PCP characterization of NP where the verifier makes 3 queries and has a onesided error that is bounded away from 1; and also that 2 queries do not ...
Venkatesan Guruswami, Daniel Lewin, Madhu Sudan, L...
claim paper
Read More »