| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Scott Aaronson, Paul Christiano |
Quantum Money from Hidden Subspaces.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Paul Christiano |
Quantum Money from Hidden Subspaces. |
IACR Cryptology ePrint Archive |
2012 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Paul Christiano |
Quantum Money from Hidden Subspaces |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Paul Christiano |
Quantum money from hidden subspaces. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson |
A Linear-Optical Proof that the Permanent is #P-Hard. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Why Philosophers Should Care About Computational Complexity. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Impossibility of Succinct Quantum Proofs for Collision-Freeness. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Andrew Drucker |
Advice Coins for Classical and Quantum Computation. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani |
The One-Way Communication Complexity of Subgroup Membership. |
Chicago J. Theor. Comput. Sci. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Dieter van Melkebeek |
On Circuit Lower Bounds from Derandomization. |
Theory of Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson |
Quantum Copy-Protection and Quantum Money |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Why Philosophers Should Care About Computational Complexity |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Andrew Drucker |
Advice Coins for Classical and Quantum Computation |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
A Counterexample to the Generalized Linial-Nisan Conjecture |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
A Linear-Optical Proof that the Permanent is #P-Hard |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Impossibility of Succinct Quantum Proofs for Collision-Freeness |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola |
Special Section on Foundations of Computer Science. |
SIAM J. Comput. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
The Equivalence of Sampling and Searching. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson, Andrew Drucker |
Advice Coins for Classical and Quantum Computation. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson, Andris Ambainis |
The Need for Structure in Quantum Speedups. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Alex Arkhipov |
The computational complexity of linear optics. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson, Alex Arkhipov |
The Computational Complexity of Linear Optics. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Dieter van Melkebeek |
A note on circuit lower bounds from derandomization. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Baris Aydinlioglu, Harry Buhrman, John M. Hitchcock, Dieter van Melkebeek |
A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
The Equivalence of Sampling and Searching. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
A Counterexample to the Generalized Linial-Nisan Conjecture. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Andrew Drucker |
A Full Characterization of Quantum Advice. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
QIP = PSPACE breakthrough: technical perspective. |
Commun. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson, Alex Arkhipov |
The Computational Complexity of Linear Optics |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Andrew Drucker |
A Full Characterization of Quantum Advice |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
The Equivalence of Sampling and Searching |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrew Lutomirski, Scott Aaronson, Edward Farhi, David Gosset, Jonathan A. Kelner, Avinatan Hassidim, Peter W. Shor |
Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol. |
ICS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
BQP and the polynomial hierarchy. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
linial-nisan conjecture, quantum complexity classes, fourier analysis, constant-depth circuits |
| 1 | Scott Aaronson, Andrew Drucker |
A full characterization of quantum advice. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson, Avi Wigderson |
Algebrization: A New Barrier in Complexity Theory. |
TOCT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson, Andris Ambainis |
The Need for Structure in Quantum Speedups. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
BQP and the Polynomial Hierarchy. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor |
The Power of Unentanglement. |
Theory of Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson |
On perfect completeness for QMA. |
Quantum Information & Computation |
2009 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Andris Ambainis |
The Need for Structure in Quantum Speedups |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani |
The One-Way Communication Complexity of Group Membership |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
BQP and the Polynomial Hierarchy |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Sudipto Guha, Jon M. Kleinberg, Frank McSherry, Dieter van Melkebeek, Amit Sahai |
Special Issue On The Thirty-Eighth Annual ACM Symposium On Theory Of Computing (STOC 2006). |
SIAM J. Comput. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Quantum Copy-Protection and Quantum Money. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson, John Watrous |
Closed Timelike Curves Make Quantum and Classical Computing Equivalent. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor |
The Power of Unentanglement. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Avi Wigderson |
Algebrization: A New Barrier in Complexity Theory. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
On Perfect Completeness for QMA. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Quantum certificate complexity. |
J. Comput. Syst. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson |
The Polynomial Method in Quantum and Classical Computing. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor |
The Power of Unentanglement. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
QMA, 3SAT, PCP Theorem, quantum computing, additivity, entanglement |
| 1 | Scott Aaronson, Avi Wigderson |
Algebrization: a new barrier in complexity theory. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
communication complexity, oracles, arithmetization, interactive proofs, query complexity, low-degree polynomials |
| 1 | Scott Aaronson, Greg Kuperberg |
Quantum Versus Classical Proofs and Advice. |
Theory of Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson |
Review of "The Access Principle by John Willinsky, " MIT Press, 2005. |
SIGACT News |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson |
The Limits of Quantum Computers. |
CSR |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson, Greg Kuperberg |
Quantum versus Classical Proofs and Advice. |
IEEE Conference on Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson, Greg Kuperberg |
Quantum Versus Classical Proofs and Advice. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
The Learnability of Quantum States. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Greg Kuperberg |
Quantum Versus Classical Proofs and Advice |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Lower Bounds for Local Search by Quantum Arguments. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson |
Oracles Are Subtle But Not Malicious. |
IEEE Conference on Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson |
QMA/qpoly \subseteq PSPACE/poly: De-Merlinizing Quantum Protocols. |
IEEE Conference on Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson |
Quantum Computing, Postselection, and Probabilistic Polynomial-Time |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Oracles Are Subtle But Not Malicious |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
NP-complete Problems and Physical Reality |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
QMA/qpoly Is Contained In PSPACE/poly: De-Merlinizing Quantum Protocols |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Andris Ambainis |
Quantum Search of Spatial Regions. |
Theory of Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson |
Limitations of Quantum Advice and One-Way Communication. |
Theory of Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson |
Quantum lower bound for recursive fourier sampling. |
Quantum Information & Computation |
2005 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
NP-complete Problems and Physical Reality |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Oracles Are Subtle But Not Malicious |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
QMA/qpoly Is Contained In PSPACE/poly: De-Merlinizing Quantum Protocols |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Guest Column: NP-complete problems and physical reality. |
SIGACT News |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson |
The complexity of agreement. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
Bayesian agents, common priors, communication, random walks, agreement, bounded rationality |
| 1 | Scott Aaronson |
Limitations of Quantum Advice and One-Way Communication |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
The Complexity of Agreement |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Yaoyun Shi |
Quantum lower bounds for the collision and the element distinctness problems. |
J. ACM |
2004 |
DBLP DOI BibTeX RDF |
element distinctness, polynomial method, quantum lower bounds, quantum computing, Collision |
| 1 | Scott Aaronson |
The Complexity of Agreement |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Limits on Efficient Computation in the Physical World |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Limitations of Quantum Advice and One-Way Communication |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Daniel Gottesman |
Improved Simulation of Stabilizer Circuits |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Quantum Computing, Postselection, and Probabilistic Polynomial-Time |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Limitations of Quantum Advice and One-Way Communication. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson |
Multilinear formulas and skepticism of quantum computing. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
matrix rank, multilinear formula size, error-correcting codes, quantum computing |
| 1 | Scott Aaronson |
Lower bounds for local search by quantum arguments. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
query complexity (black box, decision tree), local search, quantum computing, PLS, local optima |
| 1 | Scott Aaronson |
Quantum Certificate Complexity |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Multilinear Formulas and Skepticism of Quantum Computing |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Lower Bounds for Local Search by Quantum Arguments |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Quantum lower bound for recursive Fourier sampling. |
Quantum Information & Computation |
2003 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Multilinear Formulas and Skepticism of Quantum Computing |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Lower Bounds for Local Search by Quantum Arguments |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Is P Versus NP Formally Independent? |
Bulletin of the EATCS |
2003 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Algorithms for Boolean Function Query Properties. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson, Andris Ambainis |
Quantum Search of Spatial Regions. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson |
Quantum Certificate Complexity. |
IEEE Conference on Computational Complexity |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson |
Quantum Lower Bound for Recursive Fourier Sampling |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Book review. |
Quantum Information & Computation |
2002 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Quantum Certificate Complexity |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Quantum Lower Bound for Recursive Fourier Sampling |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Quantum lower bound for the collision problem. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")