default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID29th CCC 2014: Vancouver, BC, Canada
- IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014. IEEE Computer Society 2014, ISBN 978-1-4799-3626-7
- Ryan O'Donnell, David Witmer:
Goldreich's PRG: Evidence for Near-Optimal Polynomial Stretch. 1-12 - James R. Lee, Prasad Raghavendra, David Steurer
, Ning Tan:
On the Power of Symmetric LP and SDP Relaxations. 13-21 - Aleksandrs Belovs:
Quantum Algorithms for Learning Symmetric Juntas via Adversary Bound. 22-31 - Andris Ambainis:
On Physical Problems that are Slightly More Difficult than QMA. 32-43 - Scott Aaronson, Russell Impagliazzo, Dana Moshkovitz:
AM with Multiple Merlins. 44-55 - Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami:
Counting List Matrix Partitions of Graphs. 56-65 - Simon Straub, Thomas Thierauf, Fabian Wagner:
Counting the Number of Perfect Matchings in K5-Free Graphs. 66-77 - Rishi Saket:
Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs. 78-89 - Daniele Micciancio:
Locally Dense Codes. 90-97 - Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz:
On the Closest Vector Problem with a Distance Guarantee. 98-109 - Joshua A. Grochow, Youming Qiao:
Algorithms for Group Isomorphism via Group Extensions and Cohomology. 110-119 - Karl Wimmer:
Low Influence Functions over Slices of the Boolean Hypercube Depend on Few Coordinates. 120-131 - Arturs Backurs, Mohammad Bavarian:
On the Sum of L1 Influences. 132-143 - Ryan O'Donnell, John Wright, Yu Zhao, Xiaorui Sun, Li-Yang Tan:
A Composition Theorem for Parity Kill Number. 144-154 - Shubhangi Saraf:
Recent Progress on Lower Bounds for Arithmetic Circuits. 155-160 - Venkatesan Guruswami, Chaoping Xing:
Hitting Sets for Low-Degree Polynomials with Optimal Density. 161-168 - Swastik Kopparty, Shubhangi Saraf, Amir Shpilka:
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization. 169-180 - Craig Gentry:
Noncommutative Determinant is Hard: A Simple Proof Using an Extension of Barrington's Theorem. 181-187 - Irit Dinur, David Steurer:
Direct Product Testing. 188-196 - Irit Dinur, David Steurer, Thomas Vidick:
A Parallel Repetition Theorem for Entangled Projection Games. 197-208 - Rahul Jain, Attila Pereszlényi, Penghui Yao:
A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions. 209-216 - Daniel M. Kane:
A Pseudorandom Generator for Polynomial Threshold Functions of Gaussian with Subpolynomial Seed Length. 217-228 - Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions. 229-240 - Bruno Bauwens, Marius Zimand:
Linear List-Approximation for Short Programs (or the Power of a Few Random Bits). 241-247 - Ryan Williams:
Algorithms for Circuits and Circuits for Algorithms. 248-261 - Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman:
Mining Circuit Lower Bound Proofs for Meta-algorithms. 262-273 - Joshua A. Grochow:
Unifying Known Lower Bounds via Geometric Complexity Theory. 274-285 - Albert Atserias, Massimo Lauria, Jakob Nordström:
Narrow Proofs May Be Maximally Long. 286-297 - Periklis A. Papakonstantinou, Dominik Scheder, Hao Song:
Overlays and Limited Memory Communication. 298-308 - Eric Blais, Sofya Raskhodnikova, Grigory Yaroslavtsev:
Lower Bounds for Testing Properties of Functions over Hypergrid Domains. 309-320 - Russell Impagliazzo, Valentine Kabanets:
Fourier Concentration from Shrinkage. 321-332
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-08 20:19 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:
