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
Documents 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

219 views

Scott Aaronson MIT BQP PSPACE Closed Timelike Curves Make Quantum and Classical Computing Equivalent John Watrous U. Waterloo
Documents Scott Aaronson MIT BQP PSPACE Closed Timelike Curves Make Quantum and Classical Computing Equivalent John Watrous U. Waterloo

219 views

Quantum Computing: Whats It Good For? Scott Aaronson Computer Science Department, UC Berkeley January 10, 2002 aaronson
Documents Quantum Computing: Whats It Good For? Scott Aaronson Computer Science Department, UC Berkeley January 10, 2002 aaronson

226 views

A Theory of Isolatability Scott Aaronson Andrew Drucker MIT
Documents A Theory of Isolatability Scott Aaronson Andrew Drucker MIT

233 views

The Learnability of Quantum States Scott Aaronson University of Waterloo
Documents The Learnability of Quantum States Scott Aaronson University of Waterloo

214 views

The Power of Quantum Advice Scott Aaronson Andrew Drucker
Documents The Power of Quantum Advice Scott Aaronson Andrew Drucker

223 views

NP-complete Problems and Physical Reality Scott Aaronson Institute for Advanced Study
Documents NP-complete Problems and Physical Reality Scott Aaronson Institute for Advanced Study

217 views

Scott Aaronson (MIT) Based on joint work with John Watrous (U. Waterloo) BQP PSPACE Quantum Computing With Closed Timelike Curves
Documents Scott Aaronson (MIT) Based on joint work with John Watrous (U. Waterloo) BQP PSPACE Quantum Computing With Closed Timelike Curves

217 views

Multilinear Formulas and Skepticism of Quantum Computing Scott Aaronson, UC Berkeley aaronson
Documents Multilinear Formulas and Skepticism of Quantum Computing Scott Aaronson, UC Berkeley aaronson

218 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
Documents 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

213 views

A Full Characterization of Quantum Advice Scott Aaronson Andrew Drucker
Documents A Full Characterization of Quantum Advice Scott Aaronson Andrew Drucker

213 views

BQP PSPACE NP P PostBQP Computational Intractability As A Law of Physics Scott Aaronson University of Waterloo
Documents BQP PSPACE NP P PostBQP Computational Intractability As A Law of Physics Scott Aaronson University of Waterloo

216 views