×
Log in
Upload File
Most Popular
Study
Business
Design
Technology
Travel
Explore all categories
The top documents tagged [class of problems solvable]
Algebrization: A New Barrier in Complexity Theory Scott Aaronson (MIT) Avi Wigderson (IAS) 4xyw-12yz+17xyzw-2x-2y-2z-2w IP=PSPACE MA EXP P/poly MIP=NEXP
220 views
Scott Aaronson MIT BQP PSPACE Closed Timelike Curves Make Quantum and Classical Computing Equivalent John Watrous U. Waterloo
223 views
Quantum Computing: Whats It Good For? Scott Aaronson Computer Science Department, UC Berkeley January 10, 2002 aaronson
227 views
A Theory of Isolatability Scott Aaronson Andrew Drucker MIT
236 views
The Learnability of Quantum States Scott Aaronson University of Waterloo
217 views
The Power of Quantum Advice Scott Aaronson Andrew Drucker
224 views
NP-complete Problems and Physical Reality Scott Aaronson Institute for Advanced Study
220 views
Multilinear Formulas and Skepticism of Quantum Computing Scott Aaronson, UC Berkeley aaronson
221 views
An Invitation to Quantum Complexity Theory The Study of What We Cant Do With Computers We Dont Have Scott Aaronson (MIT) QIP08, New Delhi BQP NP- complete
216 views
A Full Characterization of Quantum Advice Scott Aaronson Andrew Drucker
218 views
BQP PSPACE NP P PostBQP Computational Intractability As A Law of Physics Scott Aaronson University of Waterloo
222 views
QMA/qpoly PSPACE/poly: De-Merlinizing Quantum Protocols Scott Aaronson University of Waterloo
224 views
Next >