1. Home
  2. Proceedings
  3. CCC
  4. CCC 2014
Default Cover Image

2014 IEEE Conference on Computational Complexity (CCC)

June 11 2014 to June 13 2014

Vancouver, BC, Canada

Table of Contents

[Title page i]Freely available from IEEE.pp. i-i
[Title page iii]Freely available from IEEE.pp. iii-iii
[Copyright notice]Freely available from IEEE.pp. iv-iv
Table of contentsFreely available from IEEE.pp. v-vii
PrefaceFreely available from IEEE.pp. viii-viii
Committee ListsFreely available from IEEE.pp. ix-ix
CCC 2014 Awards: 2014 Ronald V. Book Prize for the Best Student PaperFreely available from IEEE.pp. x-x
ReviewersFreely available from IEEE.pp. xi-xii
Goldreich's PRG: Evidence for Near-Optimal Polynomial StretchFull-text access may be available. Sign in or learn about subscription options.pp. 1-12
by Ryan ODonnell, David Witmer
On the Power of Symmetric LP and SDP RelaxationsFull-text access may be available. Sign in or learn about subscription options.pp. 13-21
by James R. Lee, Prasad Raghavendra, David Steurer, Ning Tan
Quantum Algorithms for Learning Symmetric Juntas via Adversary BoundFull-text access may be available. Sign in or learn about subscription options.pp. 22-31
by Aleksandrs Belovs
On Physical Problems that are Slightly More Difficult than QMAFull-text access may be available. Sign in or learn about subscription options.pp. 32-43
by Andris Ambainis
AM with Multiple MerlinsFull-text access may be available. Sign in or learn about subscription options.pp. 44-55
by Scott Aaronson, Russell Impagliazzo, Dana Moshkovitz
Counting List Matrix Partitions of GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 56-65
by Andreas Gobel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami
Counting the Number of Perfect Matchings in K5-Free GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 66-77
by Simon Straub, Thomas Thierauf, Fabian Wagner
Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPsFull-text access may be available. Sign in or learn about subscription options.pp. 78-89
by Rishi Saket
Locally Dense CodesFull-text access may be available. Sign in or learn about subscription options.pp. 90-97
by Daniele Micciancio
On the Closest Vector Problem with a Distance GuaranteeFull-text access may be available. Sign in or learn about subscription options.pp. 98-109
by Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz
Algorithms for Group Isomorphism via Group Extensions and CohomologyFull-text access may be available. Sign in or learn about subscription options.pp. 110-119
by Joshua A. Grochow, Youming Qiao
Low Influence Functions over Slices of the Boolean Hypercube Depend on Few CoordinatesFull-text access may be available. Sign in or learn about subscription options.pp. 120-131
by Karl Wimmer
On the Sum of L1 InfluencesFull-text access may be available. Sign in or learn about subscription options.pp. 132-143
by Arturs Backurs, Mohammad Bavarian
A Composition Theorem for Parity Kill NumberFull-text access may be available. Sign in or learn about subscription options.pp. 144-154
by Ryan ODonnell, John Wright, Yu Zhao, Xiaorui Sun, Li-Yang Tan
Recent Progress on Lower Bounds for Arithmetic CircuitsFull-text access may be available. Sign in or learn about subscription options.pp. 155-160
by Shubhangi Saraf
Hitting Sets for Low-Degree Polynomials with Optimal DensityFull-text access may be available. Sign in or learn about subscription options.pp. 161-168
by Venkatesan Guruswami, Chaoping Xing
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial FactorizationFull-text access may be available. Sign in or learn about subscription options.pp. 169-180
by Swastik Kopparty, Shubhangi Saraf, Amir Shpilka
Noncommutative Determinant is Hard: A Simple Proof Using an Extension of Barrington's TheoremFull-text access may be available. Sign in or learn about subscription options.pp. 181-187
by Craig Gentry
Direct Product TestingFull-text access may be available. Sign in or learn about subscription options.pp. 188-196
by Irit Dinur, David Steurer
A Parallel Repetition Theorem for Entangled Projection GamesFull-text access may be available. Sign in or learn about subscription options.pp. 197-208
by Irit Dinur, David Steurer, Thomas Vidick
A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product DistributionsFull-text access may be available. Sign in or learn about subscription options.pp. 209-216
by Rahul Jain, Attila Pereszlenyi, Penghui Yao
A Pseudorandom Generator for Polynomial Threshold Functions of Gaussian with Subpolynomial Seed LengthFull-text access may be available. Sign in or learn about subscription options.pp. 217-228
by Daniel M. Kane
Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold FunctionsFull-text access may be available. Sign in or learn about subscription options.pp. 229-240
by Anindya De, Ilias Diakonikolas, Rocco A. Servedio
Linear List-Approximation for Short Programs (or the Power of a Few Random Bits)Full-text access may be available. Sign in or learn about subscription options.pp. 241-247
by Bruno Bauwens, Marius Zimand
Algorithms for Circuits and Circuits for AlgorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 248-261
by Ryan Williams
Mining Circuit Lower Bound Proofs for Meta-algorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 262-273
by Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman
Unifying Known Lower Bounds via Geometric Complexity TheoryFull-text access may be available. Sign in or learn about subscription options.pp. 274-285
by Joshua A. Grochow
Narrow Proofs May Be Maximally LongFull-text access may be available. Sign in or learn about subscription options.pp. 286-297
by Albert Atserias, Massimo Lauria, Jakob Nordstrom
Overlays and Limited Memory CommunicationFull-text access may be available. Sign in or learn about subscription options.pp. 298-308
by Periklis Papakonstantinou, Dominik Scheder, Hao Song
Lower Bounds for Testing Properties of Functions over Hypergrid DomainsFull-text access may be available. Sign in or learn about subscription options.pp. 309-320
by Eric Blais, Sofya Raskhodnikova, Grigory Yaroslavtsev
Fourier Concentration from ShrinkageFull-text access may be available. Sign in or learn about subscription options.pp. 321-332
by Russell Impagliazzo, Valentine Kabanets
Author indexFreely available from IEEE.pp. 333-333
[Publisher's information]Freely available from IEEE.pp. 334-334
Showing 41 out of 41