Articles under category:
Complexity Classes
Complexity Classes
|
Vol 17, Article 8 (pp 1-28)
The Layer Complexity of Arthur-Merlin-like Communication by Dmitry Gavinsky |
|
Vol 14, Article 22 (pp 1-17)
On Multiparty Communication with Large versus Unbounded Error by Alexander A. Sherstov |
|
Vol 14, Article 21 (pp 1-23)
Separation of Unbounded-Error Models in Multi-Party Communication Complexity by Arkadev Chattopadhyay and Nikhil S. Mande |
|
Vol 12, Article 9 (pp 1-23)
[APRX-RND14 Spec Issue]
Communication Complexity of Set-Disjointness for All Probabilities by Mika Göös and Thomas Watson |
|
Vol 11, Article 20 (pp 491-603)
The Bose-Hubbard Model is QMA-complete by Andrew M. Childs, David Gosset, and Zak Webb |
|
Vol 11, Article 1 (pp 1-34)
The Complexity of Deciding Statistical Properties of Samplable Distributions by Thomas Watson |
|
Vol 10, Article 12 (pp 297-339)
Width-Parametrized SAT: Time--Space Tradeoffs by Eric Allender, Shiteng Chen, Tiancheng Lou, Periklis A. Papakonstantinou, and Bangsheng Tang |
|
Vol 10, Article 8 (pp 199-215)
Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata by Eric Allender and Klaus-Jörn Lange |
|
Vol 5, Article 1 (pp 1-42)
The Power of Unentanglement by Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, and Peter Shor |
|
Vol 3, Article 7 (pp 129-157)
Quantum Versus Classical Proofs and Advice by Scott Aaronson and Greg Kuperberg |
|
Vol 3, Article 4 (pp 61-79)
A Simple PromiseBQP-complete Matrix Problem by Dominik Janzing and Pawel Wocjan |
|
Vol 2, Article 6 (pp 121-135)
Separation of Multilinear Circuit and Formula Size by Ran Raz |
|
Vol 1, Article 1 (pp 1-28)
Limitations of Quantum Advice and One-Way Communication by Scott Aaronson |