loading...
A 3-Query Non-Adaptive PCP with Perfect Completeness
Prague, Czech Republic July 16-July 20
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CCC.2006.521st Annual IEEE Conference on Compu ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Subhash Khot, Rishi Saket, "A 3-Query Non-Adaptive PCP with Perfect Completeness," Computational Complexity, Annual IEEE Conference on, pp. 159-169, 21st Annual IEEE Conference on Computational Complexity (CCC'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/CCC.2006.5,
author = {Subhash Khot and Rishi Saket},
title = {A 3-Query Non-Adaptive PCP with Perfect Completeness},
journal ={Computational Complexity, Annual IEEE Conference on},
volume = {0},
year = {2006},
issn = {1093-0159},
pages = {159-169},
doi = {http://doi.ieeecomputersociety.org/10.1109/CCC.2006.5},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computational Complexity, Annual IEEE Conference on
TI - A 3-Query Non-Adaptive PCP with Perfect Completeness
SN - 1093-0159
SP159
EP169
A1 - Subhash Khot,
A1 - Rishi Saket,
PY - 2006
KW - null
VL - 0
JA - Computational Complexity, Annual IEEE Conference on
ER -
 
Subhash Khot, Georgia Institute of Technology, USA
Rishi Saket, Georgia Institute of Technology, USA
We study a very basic open problem regarding the PCP characterization of NP, namely, the power of PCPs with non-adaptive queries and perfect completeness. The lowest soundness known till now for such a PCP is \frac{6}{8} + \in given by a construction of H?astad [11]. However, Zwick [15] shows that a -query non-adaptive PCP with perfect completeness cannot achieve soundness below \frac{5}{8}.
Citation:
Subhash Khot, Rishi Saket, "A 3-Query Non-Adaptive PCP with Perfect Completeness," ccc, pp.159-169, 21st Annual IEEE Conference on Computational Complexity (CCC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.