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

2012 IEEE 27th Conference on Computational Complexity

June 26 2012 to June 29 2012

Porto Portugal

ISSN: 1093-0159

ISBN: 978-0-7695-4708-4

Table of Contents

Papers
[Title page i]Freely available from IEEE.pp. i
Papers
[Title page iii]Freely available from IEEE.pp. iii
Papers
[Copyright notice]Freely available from IEEE.pp. iv
Papers
PrefaceFreely available from IEEE.pp. ix-ix
Papers
Table of contentsFreely available from IEEE.pp. v-viii
Papers
Organizing CommitteeFreely available from IEEE.pp. x-x
Papers
Program CommitteeFreely available from IEEE.pp. xi-xi
Papers
ReviewersFreely available from IEEE.pp. xii-xiii
Papers
Amplifying Circuit Lower Bounds against Polynomial Time with ApplicationsFull-text access may be available. Sign in or learn about subscription options.pp. 1-9
AwardsFreely available from IEEE.pp. xiv-xiv
Papers
Is Valiant-Vazirani's Isolation Probability Improvable?Full-text access may be available. Sign in or learn about subscription options.pp. 10-20
Papers
Parallel Approximation of Min-max Problems with Applications to Classical and Quantum Zero-Sum GamesFull-text access may be available. Sign in or learn about subscription options.pp. 21-31
Papers
The Complexity of the Separable Hamiltonian ProblemFull-text access may be available. Sign in or learn about subscription options.pp. 32-41
Papers
Quantum Money with Classical VerificationFull-text access may be available. Sign in or learn about subscription options.pp. 42-52
Papers
On the Usefulness of PredicatesFull-text access may be available. Sign in or learn about subscription options.pp. 53-63
Papers
Reductions between Expansion ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 64-73
Papers
On Problems as Hard as CNF-SATFull-text access may be available. Sign in or learn about subscription options.pp. 74-84
Papers
Testing List H-homomorphismsFull-text access may be available. Sign in or learn about subscription options.pp. 85-95
Papers
A Dichotomy for Real Weighted Holant ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 96-106
Papers
A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary BasisFull-text access may be available. Sign in or learn about subscription options.pp. 107-116
Papers
Approximating AC^0 by Small Height Decision Trees and a Deterministic Algorithm for #AC^0SATFull-text access may be available. Sign in or learn about subscription options.pp. 117-125
Papers
DNF Sparsification and a Faster Deterministic Counting AlgorithmFull-text access may be available. Sign in or learn about subscription options.pp. 126-135
Papers
Communication Complexity and Information Complexity: Foundations and New DirectionsFull-text access may be available. Sign in or learn about subscription options.pp. 136-136
Papers
Gaussian Noise Sensitivity and Fourier TailsFull-text access may be available. Sign in or learn about subscription options.pp. 137-147
Papers
Junto-Symmetric Functions, Hypergraph Isomorphism and CrunchingFull-text access may be available. Sign in or learn about subscription options.pp. 148-158
Papers
Complexity Lower Bounds through Balanced Graph PropertiesFull-text access may be available. Sign in or learn about subscription options.pp. 159-169
Papers
Limitations of Lower-Bound Methods for the Wire Complexity of Boolean OperatorsFull-text access may be available. Sign in or learn about subscription options.pp. 170-180
Papers
Limits on Alternation-Trading Proofs for Time-Space Lower BoundsFull-text access may be available. Sign in or learn about subscription options.pp. 181-191
Papers
The Hardness of Being PrivateFull-text access may be available. Sign in or learn about subscription options.pp. 192-202
Papers
Matrix Isomorphism of Matrix Lie AlgebrasFull-text access may be available. Sign in or learn about subscription options.pp. 203-213
Papers
On Sunflowers and Matrix MultiplicationFull-text access may be available. Sign in or learn about subscription options.pp. 214-223
Papers
Algebras of Minimal Multiplicative ComplexityFull-text access may be available. Sign in or learn about subscription options.pp. 224-234
Papers
Prospects for Geometric Complexity TheoryFull-text access may be available. Sign in or learn about subscription options.pp. 235-235
Papers
A Strong Direct Product Theorem for Quantum Query ComplexityFull-text access may be available. Sign in or learn about subscription options.pp. 236-246
Papers
A Strong Parallel Repetition Theorem for Projection Games on ExpandersFull-text access may be available. Sign in or learn about subscription options.pp. 247-257
Papers
Share Conversion and Private Information RetrievalFull-text access may be available. Sign in or learn about subscription options.pp. 258-268
Papers
Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin GamesFull-text access may be available. Sign in or learn about subscription options.pp. 269-279
Papers
Hitting Set Generators for Sparse Polynomials over Any Finite FieldsFull-text access may be available. Sign in or learn about subscription options.pp. 280-286
Papers
Pseudorandom Generators for Read-Once ACC^0Full-text access may be available. Sign in or learn about subscription options.pp. 287-297
Papers
Non-malleable Extractors with Short Seeds and Applications to Privacy AmplificationFull-text access may be available. Sign in or learn about subscription options.pp. 298-308
Papers
Better Condensers and New Extractors from Parvaresh-Vardy CodesFull-text access may be available. Sign in or learn about subscription options.pp. 309-315
Papers
List Decoding Barnes-Wall LatticesFull-text access may be available. Sign in or learn about subscription options.pp. 316-325
Papers
Space-Efficient Algorithms for Reachability in Surface-Embedded GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 326-333
Papers
Space Complexity in Polynomial CalculusFull-text access may be available. Sign in or learn about subscription options.pp. 334-344
Papers
Combinatorial PCPs with Short ProofsFull-text access may be available. Sign in or learn about subscription options.pp. 345-355
Papers
Author indexFreely available from IEEE.pp. 356-356
Papers
[Publisher's information]Freely available from IEEE.pp. 358
Showing 47 out of 47