default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing, Volume 11
Volume 11, 2015
- Thomas Watson:
The Complexity of Deciding Statistical Properties of Samplable Distributions. 1-34 - John D. Faben, Mark Jerrum:
The Complexity of Parity Graph Homomorphism: An Initial Investigation. 35-57 - Gus Gutoski, Patrick M. Hayden
, Kevin Milner, Mark M. Wilde:
Quantum Interactive Proofs and the Complexity of Separability Testing. 59-103 - David Kempe, Jon M. Kleinberg, Éva Tardos:
Maximizing the Spread of Influence through a Social Network. 105-147 - Swastik Kopparty:
List-Decoding Multiplicity Codes. 149-182 - Greg Kuperberg:
How Hard Is It to Approximate the Jones Polynomial? 183-219 - Dana Moshkovitz:
The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover. 221-235 - Sofya Raskhodnikova, Ola Svensson:
Special Issue: APPROX-RANDOM 2013: Guest Editors' Foreword. 237-239 - Shayan Oveis Gharan, Luca Trevisan:
A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs. 241-256 - Per Austrin, Rajsekar Manokaran, Cenny Wenner:
On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems. 257-283 - Joseph M. Landsberg, Giorgio Ottaviani:
New Lower Bounds for the Border Rank of Matrix Multiplication. 285-298 - Elad Haramaty, Noga Ron-Zewi, Madhu Sudan:
Absolutely Sound Testing of Lifted Codes. 299-338 - Alexander I. Barvinok:
Computing the Partition Function for Cliques in a Graph. 339-355 - Pavel Hrubes, Avi Wigderson:
Non-Commutative Arithmetic Circuits with Division. 357-393 - George Glauberman, Lukasz Grabowski:
Groups with Identical k-Profiles. 395-401 - Aleksandrs Belovs, Eric Blais:
Quantum Algorithm for Monotonicity Testing on the Hypercube. 403-412 - Emmanuel Abbe, Andrea Montanari:
Conditional Random Fields, Planted Constraint Satisfaction, and Entropy Concentration. 413-443 - Jacek Jendrej, Krzysztof Oleszkiewicz, Jakub Onufry Wojtaszczyk:
On some extensions of the FKN theorem. 445-469 - Joshua Brody, Kasper Green Larsen:
Adapt or Die: Polynomial Lower Bounds for Non-Adaptive Dynamic Data Structures. 471-489 - Andrew M. Childs, David Gosset, Zak Webb:
The Bose-Hubbard Model is QMA-complete. 491-603
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-12-04 22:08 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:
