default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing, Volume 13
Volume 13, Number 1, 2017
- Prahladh Harsha
:
Special Issue: CCC 2016: Guest Editor's Foreword. 1-3 - Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs. 1-21 - Venkatesan Guruswami, Euiwoong Lee:
Towards a Characterization of Approximation Resistance for Symmetric CSPs. 1-24 - Cody D. Murray, R. Ryan Williams:
On the (Non) NP-Hardness of Computing Circuit Complexity. 1-22 - Yury Makarychev, Amir Nayyeri, Anastasios Sidiropoulos:
A Pseudo-Approximation for the Genus of Hamiltonian Graphs. 1-47 - Mrinal Kumar, Shubhangi Saraf:
Arithmetic Circuits with Locally Low Algebraic Rank. 1-33 - Justin Gilmer, Michal Koucký, Michael E. Saks:
A Communication Game Related to the Sensitivity Conjecture. 1-18 - Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
The Minimum Bisection in the Planted Bisection Model. 1-22 - Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan:
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials. 1-34 - Johan Håstad, Rajsekar Manokaran:
On the Hardness of Approximating Balanced Homogenous 3-Lin. 1-19 - Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Superquadratic Lower Bound for 3-Query Locally Correctable Codes over the Reals. 1-36 - Thomas Steinke, Salil P. Vadhan, Andrew Wan:
Pseudorandomness and Fourier-Growth Bounds for Width-3 Branching Programs. 1-50 - Maria-Florina Balcan, Mark Braverman:
Nash Equilibria in Perturbation-Stable Games. 1-31 - David Felber, Rafail Ostrovsky:
A Randomized Online Quantile Summary in O((1/ε) log(1/ε)) Words. 1-17 - Jop Briët, Oded Regev, Rishi Saket:
Tight Hardness of the Non-Commutative Grothendieck Problem. 1-24 - Chin Ho Lee, Emanuele Viola:
Some Limitations of the Sum of Small-Bias Distributions. 1-23 - David G. Harris, Aravind Srinivasan:
A Constructive Lovász Local Lemma for Permutations. 1-41 - Joshua A. Grochow:
Monotone Projection Lower Bounds from Extended Formulation Lower Bounds. 1-15 - Johan Håstad, Sangxia Huang, Rajsekar Manokaran, Ryan O'Donnell, John Wright:
Improved NP-Inapproximability for 2-Variable Linear Equations. 1-51 - F. Bruce Shepherd, Adrian R. Vetta:
The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems. 1-25 - John Y. Kim, Swastik Kopparty:
Decoding Reed-Muller Codes over Product Sets. 1-38
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-05 22:24 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:
