loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
21st Annual IEEE Conference on Computational Complexity (CCC'06)
Oracles Are Subtle But Not Malicious
Prague, Czech Republic
July 16-July 20
ISBN: 0-7695-2596-2
ASCII Text
x 
 
Scott Aaronson, "Oracles Are Subtle But Not Malicious," Computational Complexity, Annual IEEE Conference on, pp. 340-354, 21st Annual IEEE Conference on Computational Complexity (CCC'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/CCC.2006.32,
author = {Scott Aaronson},
title = {Oracles Are Subtle But Not Malicious},
journal ={Computational Complexity, Annual IEEE Conference on},
volume = {0},
year = {2006},
issn = {1093-0159},
pages = {340-354},
doi = {http://doi.ieeecomputersociety.org/10.1109/CCC.2006.32},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computational Complexity, Annual IEEE Conference on
TI - Oracles Are Subtle But Not Malicious
SN - 1093-0159
SP340
EP354
A1 - Scott Aaronson,
PY - 2006
KW - null
VL - 0
JA - Computational Complexity, Annual IEEE Conference on
ER -
 
Scott Aaronson, University of Waterloo
Theoretical computer scientists have been debating the role of oracles since the 1970?s. This paper illustrates both that oracles can give us nontrivial insights about the barrier problems in circuit complexity, and that they need not prevent us from trying to solve those problems.
Citation:
Scott Aaronson, "Oracles Are Subtle But Not Malicious," ccc, pp.340-354, 21st Annual IEEE Conference on Computational Complexity (CCC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.