default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Complexity, Volume 22
Volume 22, Number 1, March 2013
- Meena Mahajan
, B. V. Raghavendra Rao:
Small Space Analogues of Valiant's Classes and the Limitations of Skew Formulas. 1-38 - Chandan Saha, Ramprasad Saptharishi, Nitin Saxena:
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality. 39-69 - Dima Grigoriev:
Complexity of Solving Tropical Linear Systems. 71-88 - Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron:
Comparing the strength of query types in property testing: The case of k-colorability. 89-135 - Elena Grigorescu, Tali Kaufman, Madhu Sudan:
2-Transitivity is Insufficient for Local Testability. 137-158 - Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang, Liang Feng Zhang:
Query-Efficient Locally Decodable Codes of Subexponential Length. 159-189 - Stefan S. Dantchev, Barnaby Martin:
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. 191-213
Volume 22, Number 2, June 2013
- Boaz Barak, Irit Dinur:
Special Issue "Conference on Computational Complexity 2012" Guest editors' foreword. 215-217 - Noga Alon, Amir Shpilka, Christopher Umans:
On sunflowers and matrix multiplication. 219-243 - Kazuhisa Seto, Suguru Tamaki:
A satisfiability algorithm and average-case hardness for formulas over the full binary basis. 245-274 - Parikshit Gopalan, Raghu Meka, Omer Reingold:
DNF sparsification and a faster deterministic counting algorithm. 275-310 - Richard J. Lipton, Ryan Williams:
Amplifying circuit lower bounds against polynomial time, with applications. 311-343 - Holger Dell, Valentine Kabanets, Dieter van Melkebeek, Osamu Watanabe:
Is Valiant-Vazirani's isolation probability improvable? 345-383 - Gus Gutoski, Xiaodi Wu:
Parallel Approximation of Min-Max Problems. 385-428 - Troy Lee, Jérémie Roland:
A strong direct product theorem for quantum query complexity. 429-462
Volume 22, Number 3, September 2013
- Adrien Poteaux, Éric Schost:
Modular Composition Modulo Triangular Sets and Applications. 463-516 - Maurice J. Jansen, Meena Mahajan, B. V. Raghavendra Rao:
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits. 517-564 - Ronen Shaltiel:
Derandomized Parallel Repetition Theorems for Free Games. 565-594 - Jeff Ford, Anna Gál:
Hadamard tensors and lower bounds on multiparty communication complexity. 595-622 - Ilias Diakonikolas, Rocco A. Servedio:
Improved Approximation of Linear Threshold Functions. 623-677
Volume 22, Number 4, December 2013
- Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka:
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields. 679-725 - Thomas Watson:
Pseudorandom generators for combinatorial checkerboards. 727-769 - Alexander Yu. Olshanskii:
Space Functions and Space Complexity of the Word Problem in Semigroups. 771-830
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-04-11 18:16 CEST 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:
