NDLI: A tight characterization of NP with 3 query PCPs

Content Provider	IEEE Xplore Digital Library
Author	Guruswami, V. Lewin, D. Sudan, M. Trevisan, L.
Copyright Year	1998
Description	Author affiliation: Lab. for Comput. Sci., MIT, Cambridge, MA, USA (Guruswami, V.)
Abstract	It is known that there exists a PCP characterization of NP where the verifier makes 3 queries and has a one-sided error that is bounded away from 1; and also that 2 queries do not suffice for such a characterization. Thus PCPs with 3 queries possess non-trivial verification power and motivate the task of determining the lowest error that can be achieved with a 3-query PCP. Recently, Hastad (1997) has shown a tight characterization of NP by constructing a 3-query PCP verifier with "error" arbitrarily close to 1/2. Unfortunately this verifier makes two-sided error and Hastad makes essential use of this feature. One-sided error, on the other hand, is a natural notion to associate with a proof system, since it has the desirable property that every rejected proof has a short counterexample. The question of determining the smallest error for which there exists a 3-query PCP verifier making one-sided error and accepting an NP-complete language, however, remained open. We resolve this question by showing that NP has a 3-query PCP with a one-sided error that is arbitrarily close to 1/2. This characterization is tight, i.e., the error cannot be lower. This result is in seeming contradiction with the results of Trevisan (1997) and Zwick (1998) who show that in order to recognize an NP-complete language, the error probability of a PCP verifier making 3 non-adaptive queries and having one-sided error must be at least 5/8. We get around this bottleneck by designing an adaptive 3-query PCP for NP. Our result yields the first tight analysis of an adaptive PCP; and reveals a previously unsuspected separation between the powers of adaptive and non-adaptive PCPs. Our design and analysis of adaptive PCPs can be extended to higher number of queries as well and we give an example of such a proof system with 5 queries. Our adaptive verifiers yield proof systems whose error probabilities match those of previous constructions, while also achieving one-sidedness in the error. This raises new questions about the power of adaptive PCPs, which deserve further study.
Starting Page	8
Ending Page	17
File Size	166264
Page Count	10
File Format	PDF
ISBN	0818691727
ISSN	02725428
DOI	10.1109/SFCS.1998.743424
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1998-11-08
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Read only memory National electric code Computer errors Laboratories Computer science Bridges Electrical capacitance tomography Error probability
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Probabilistically checkable proofs with low amortized query complexity

A tight characterization of np with 3 query pcps (1998).

A tight characterization of NP with 3 query PCPs (1998)

A tight characterization of NP with 3 query PCPs (1998)

Towards the computational perception of action

Energy-conscious HW/SW-partitioning of embedded systems: a case study on an MPEG-2 encoder

Query evaluation in almost consistent databases using residues

Conflict tolerant queries in AURORA

A tool for securely integrating legacy systems into a distributed environment

A tight characterization of NP with 3 query PCPs

Similar Documents

Probabilistically checkable proofs with low amortized query complexity

A tight characterization of np with 3 query pcps (1998).

A tight characterization of NP with 3 query PCPs (1998)

A tight characterization of NP with 3 query PCPs (1998)

Towards the computational perception of action

Energy-conscious HW/SW-partitioning of embedded systems: a case study on an MPEG-2 encoder

Query evaluation in almost consistent databases using residues

Conflict tolerant queries in AURORA

A tool for securely integrating legacy systems into a distributed environment

A tight characterization of NP with 3 query PCPs