×
Log in
Upload File
Most Popular
Study
Business
Design
Technology
Travel
Explore all categories
The top documents tagged [approximate counting]
Efficient Simulation of Quantum Mechanics Collapses the Polynomial Hierarchy Scott Aaronson Alex Arkhipov MIT (yes, really)
227 views
Scott Aaronson (MIT) BQP and PH A tale of two strong-willed complexity classes… A 16-year-old quest to find an oracle that separates them… A solution at
212 views
Quantum Computing with Noninteracting Bosons Scott Aaronson (MIT) Based on joint work with Alex Arkhipov
218 views
Scott Aaronson BQP und PH A tale of two strong-willed complexity classes… A 16-year-old quest to find an oracle that separates them… A solution at lastbut
217 views
Arthur, Merlin, and Black-Box Groups in Quantum Computing Scott Aaronson (MIT) Or, How Laci Did Quantum Stuff Without Knowing It
214 views
Bounded-depth circuits: Separating wires from gates Michal Koucký Joint work with: Pavel Pudlák and Denis Thérien
213 views
Complexity Theory Lecture 7 Lecturer: Moni Naor. Recap Last week: Non-Uniform Complexity Classes Polynomial Time Hierarchy –BPP in hierarchy –If NP µ
217 views
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 12 June 18, 2006
216 views
1 Towards Efficient Sampling: Exploiting Random Walk Strategy Wei Wei, Jordan Erenrich, and Bart Selman
217 views
1 Sampling, Counting, and Probabilistic Inference Wei joint work with Bart Selman
215 views
Spatial decay of correlations and efficient methods for computing partition functions
23 views
Information Discovery in Computer Science Richard Pears and Laura Jeffrey Liaison Librarians
218 views
Next >
