loading...
NP with Small Advice
San Jose, CA June 11-June 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CCC.2005.1520th Annual IEEE Conference on Comput ...
 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 
 
Lance Fortnow, Adam R. Klivans, "NP with Small Advice," Computational Complexity, Annual IEEE Conference on, pp. 228-234, 20th Annual IEEE Conference on Computational Complexity (CCC'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/CCC.2005.15,
author = {Lance Fortnow and Adam R. Klivans},
title = {NP with Small Advice},
journal ={Computational Complexity, Annual IEEE Conference on},
volume = {0},
year = {2005},
issn = {1093-0159},
pages = {228-234},
doi = {http://doi.ieeecomputersociety.org/10.1109/CCC.2005.15},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computational Complexity, Annual IEEE Conference on
TI - NP with Small Advice
SN - 1093-0159
SP228
EP234
A1 - Lance Fortnow,
A1 - Adam R. Klivans,
PY - 2005
KW - null
VL - 0
JA - Computational Complexity, Annual IEEE Conference on
ER -
 
Lance Fortnow, University of Chicago
Adam R. Klivans, University of Texas at Austin
We prove a new equivalence between the non-uniform and uniform complexity of exponential time. We show that EXP ?⊆ NP/log if and only if EXP = P_\parallel ^{NP}. Our equivalence makes use of a recent result due to Shaltiel and Umans showing EXP in P_\parallel ^{NP} implies EXP in NP/poly.
Citation:
Lance Fortnow, Adam R. Klivans, "NP with Small Advice," ccc, pp.228-234, 20th Annual IEEE Conference on Computational Complexity (CCC'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.