CCC A

32 papers

YearTitle / Authors
2014A Composition Theorem for Parity Kill Number.
Ryan O'Donnell, John Wright, Yu Zhao, Xiaorui Sun, Li-Yang Tan
2014A Parallel Repetition Theorem for Entangled Projection Games.
Irit Dinur, David Steurer, Thomas Vidick
2014A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions.
Rahul Jain, Attila Pereszlényi, Penghui Yao
2014A Pseudorandom Generator for Polynomial Threshold Functions of Gaussian with Subpolynomial Seed Length.
Daniel M. Kane
2014AM with Multiple Merlins.
Scott Aaronson, Russell Impagliazzo, Dana Moshkovitz
2014Algorithms for Circuits and Circuits for Algorithms.
Ryan Williams
2014Algorithms for Group Isomorphism via Group Extensions and Cohomology.
Joshua A. Grochow, Youming Qiao
2014Counting List Matrix Partitions of Graphs.
Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami
2014Counting the Number of Perfect Matchings in K5-Free Graphs.
Simon Straub, Thomas Thierauf, Fabian Wagner
2014Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions.
Anindya De, Ilias Diakonikolas, Rocco A. Servedio
2014Direct Product Testing.
Irit Dinur, David Steurer
2014Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization.
Swastik Kopparty, Shubhangi Saraf, Amir Shpilka
2014Fourier Concentration from Shrinkage.
Russell Impagliazzo, Valentine Kabanets
2014Goldreich's PRG: Evidence for Near-Optimal Polynomial Stretch.
Ryan O'Donnell, David Witmer
2014Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs.
Rishi Saket
2014Hitting Sets for Low-Degree Polynomials with Optimal Density.
Venkatesan Guruswami, Chaoping Xing
2014IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014
2014Linear List-Approximation for Short Programs (or the Power of a Few Random Bits).
Bruno Bauwens, Marius Zimand
2014Locally Dense Codes.
Daniele Micciancio
2014Low Influence Functions over Slices of the Boolean Hypercube Depend on Few Coordinates.
Karl Wimmer
2014Lower Bounds for Testing Properties of Functions over Hypergrid Domains.
Eric Blais, Sofya Raskhodnikova, Grigory Yaroslavtsev
2014Mining Circuit Lower Bound Proofs for Meta-algorithms.
Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman
2014Narrow Proofs May Be Maximally Long.
Albert Atserias, Massimo Lauria, Jakob Nordström
2014Noncommutative Determinant is Hard: A Simple Proof Using an Extension of Barrington's Theorem.
Craig Gentry
2014On Physical Problems that are Slightly More Difficult than QMA.
Andris Ambainis
2014On the Closest Vector Problem with a Distance Guarantee.
Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz
2014On the Power of Symmetric LP and SDP Relaxations.
James R. Lee, Prasad Raghavendra, David Steurer, Ning Tan
2014On the Sum of L1 Influences.
Arturs Backurs, Mohammad Bavarian
2014Overlays and Limited Memory Communication.
Periklis A. Papakonstantinou, Dominik Scheder, Hao Song
2014Quantum Algorithms for Learning Symmetric Juntas via Adversary Bound.
Aleksandrs Belovs
2014Recent Progress on Lower Bounds for Arithmetic Circuits.
Shubhangi Saraf
2014Unifying Known Lower Bounds via Geometric Complexity Theory.
Joshua A. Grochow