Oracles Are Subtle But Not Malicious

Authors:
Scott Aaronson
Affiliations:
University of Waterloo
Venue:
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Year:
2006

Citing 0
Cited 4

Circuit lower bounds for Merlin-Arthur classes

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Algebrization: a new barrier in complexity theory

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Algebrization: A New Barrier in Complexity Theory

ACM Transactions on Computation Theory (TOCT)
A full characterization of quantum advice

Proceedings of the forty-second ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.