Abstract:
The authors give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verifi...Show MoreMetadata
Abstract:
The authors give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilistically in polynomial time using logarithmic number of random bits and sub-logarithmic number of queries to the proof. This is a non-relativizing characterization of NP. They discuss implications of this characterization; specifically, they show that approximating clique (or independent set) is NP-hard.<>
Date of Conference: 24-27 October 1992
Date Added to IEEE Xplore: 06 August 2002
Print ISBN:0-8186-2900-2
Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- Running Time ,
- Algebra ,
- Average Probability ,
- Estimation Problem ,
- Constant Factor ,
- Random Points ,
- Polynomial Of Degree ,
- Submatrix ,
- Information Bits ,
- Probability 1 ,
- Forward Error Correction ,
- String Length ,
- Table Entries ,
- System A ,
- Coding Theory ,
- Identically Zero ,
- Non-deterministic Polynomial-time ,
- Verification Procedure
Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- Running Time ,
- Algebra ,
- Average Probability ,
- Estimation Problem ,
- Constant Factor ,
- Random Points ,
- Polynomial Of Degree ,
- Submatrix ,
- Information Bits ,
- Probability 1 ,
- Forward Error Correction ,
- String Length ,
- Table Entries ,
- System A ,
- Coding Theory ,
- Identically Zero ,
- Non-deterministic Polynomial-time ,
- Verification Procedure
