default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChicago Journal of Theoretical Computer Science, Volume 2013
Volume 2013, 2013
- Alessandro Chiesa, Michael A. Forbes:
Improved Soundness for QMA with Multiple Provers. - Bernd Borchert, Pierre McKenzie, Klaus Reinhardt:
Few Product Gates but Many Zeroes. - Ilir Çapuni, Péter Gács:
A Turing Machine Resisting Isolated Bursts Of Faults. - Shelby Kimmel:
Quantum Adversary (Upper) Bound. - Eric Allender, George Davie, Luke Friedman, Samuel Hopkins, Iddo Tzameret:
Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic. - Harry Buhrman, David García-Soriano, Arie Matsliah, Ronald de Wolf:
The non-adaptive query complexity of testing k-parities. - Gus Gutoski:
Interactive proofs with competing teams of no-signaling provers. - John Watrous:
Simpler semidefinite programs for completely bounded norms. - Alexandr Kazda:
Complexity of the homomorphism extension problem in the random case. - Niel de Beaudrap:
On the complexity of solving linear congruences and computing nullspaces modulo a constant. - Debbie W. Leung, Benjamin Toner, John Watrous:
Coherent state exchange in multi-prover quantum interactive proof systems. - Nir Ailon:
A Lower Bound for Fourier Transform Computation in a Linear Model Over 2x2 Unitary Gates Using Matrix Entropy. - Parinya Chalermsook, Shiva Kintali, Richard J. Lipton, Danupon Nanongkai:
Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs. - Tom Gur, Omer Tamuz:
Testing Booleanity and the Uncertainty Principle.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-01 15:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
