default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Complexity, Volume 24
Volume 24, Number 1, March 2015
- Hervé Fournier, Guillaume Malod, Stefan Mengel:
Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy. 1-30 - Dima Grigoriev, Vladimir V. Podolskii
:
Complexity of Tropical and Min-plus Linear Prevarieties. 31-64 - Arnab Bhattacharyya, Ning Xie:
Lower bounds for testing triangle-freeness in Boolean functions. 65-101 - Ishay Haviv:
The remote set problem on lattices. 103-131 - Tom Cooney, Marius Junge, Carlos Palazuelos, David Pérez-García:
Rank-one quantum games. 133-196
Volume 24, Number 2, June 2015
- Michael E. Saks:
Special issue "Conference on Computational Complexity 2014" Guest Editor's Foreword. 197-199 - Irit Dinur, David Steurer, Thomas Vidick:
A parallel repetition theorem for entangled projection games. 201-254 - Aleksandrs Belovs:
Quantum Algorithms for Learning Symmetric Juntas via the Adversary Bound. 255-293 - Swastik Kopparty, Shubhangi Saraf, Amir Shpilka:
Equivalence of Polynomial Identity Testing and Polynomial Factorization. 295-331 - Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman:
Mining Circuit Lower Bound Proofs for Meta-Algorithms. 333-392 - Joshua A. Grochow:
Unifying Known Lower Bounds via Geometric Complexity Theory. 393-475
Volume 24, Number 3, September 2015
- Amir Shpilka, Ilya Volkovich:
Read-once polynomial identity testing. 477-532 - Samuel R. Buss, Ryan Williams:
Limits on Alternation Trading Proofs for Time-Space Lower Bounds. 533-600 - Eli Ben-Sasson, Michael Viderman:
Composition of semi-LTCs by two-wise tensor products. 601-643 - Anil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen:
The NOF Multiparty Communication Complexity of Composed Functions. 645-694
Volume 24, Number 4, December 2015
- Matthew Anderson, Dieter van Melkebeek, Ilya Volkovich:
Deterministic polynomial identity tests for multilinear bounded-read formulae. 695-776 - Arne Storjohann:
On the complexity of inverting integer and polynomial matrices. 777-821 - Thomas Watson:
Query Complexity in Errorless Hardness Amplification. 823-850 - Noga Alon, Gil Cohen:
On Rigid Matrices and U-Polynomials. 851-879
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-01-06 01:45 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:
