Back to Results
First PageMeta Content
Complexity classes / Quantum complexity theory / Models of computation / Mathematical optimization / P versus NP problem / Quantum computer / PP / BQP / Bounded-error probabilistic polynomial / Theoretical computer science / Computational complexity theory / Applied mathematics


Document Date: 2008-10-15 14:48:47

Open Document

File Size: 209,05 KB

Share Result on Facebook

Country

Canada / /

/

Facility

Canadian Institute / Classical Computing Equivalent Scott Aaronson∗ MIT John Watrous† University of Waterloo Abstract While / /

IndustryTerm

parallel algorithms / computing / simulation algorithm / honest accounting / deterministic polynomial-time algorithm / polynomialtime algorithm / /

NaturalFeature

mT / 0 mT / /

Organization

Keck Foundation / University of Waterloo Abstract While / NC(nc ) / MIT / Canadian Institute for Advanced Research / /

Person

Lance Fortnow / John Watrous / /

/

ProgrammingLanguage

R / C / /

ProvinceOrState

North Carolina / /

Technology

deterministic CTC algorithm / quantum CTC algorithm / polynomialtime algorithm / CTC algorithms / CTC algorithm / simulation / deterministic polynomial-time algorithm / PSPACE simulation algorithm / /

SocialTag