2012 IEEE 27th Conference on Computational Complexity (2011)

San Jose, California USA

June 8, 2011 to June 11, 2011

ISSN: 1093-0159

ISBN: 978-0-7695-4411-3

pp: C1

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CCC.2011.42

ABSTRACT

The following topics are dealt with: computational complexity; improved direct product theorems; branching programs; Max-2Lin hardness; Max-3Lin hardness; query complexity; nonnegatively weighted #CSP; symmetrix LDPC codes; locally testable codes; linear-algebraic list decoding; noise interpolation; Parris-Harrington tautologies; nonuniform ACC circuit lower bounds; affine extractors; affine dispensers; near-optimal inequality violations; explicit bell inequality violations; approximation algorithms; Arthur Merlin games; symmetric Boolean functions; property testing; communication complexity; derandomizing polynomial identity testing; tensor rank; sum of square roots; and finite Abelian groups.

INDEX TERMS

tensors, approximation theory, Boolean functions, communication complexity, constraint theory, game theory, group theory, interpolation, linear codes, parity check codes, query processing, finite Abelian groups, computational complexity, improved direct product theorems, branching programs, Max-2Lin hardness, Max-3Lin hardness, query complexity, nonnegatively weighted #CSP, symmetrix LDPC codes, locally testable codes, linear-algebraic list decoding, noise interpolation, Parris-Harrington tautologies, nonuniform ACC circuit lower bounds, affine extractors, affine dispensers, near-optimal inequality violations, explicit bell inequality violations, approximation algorithms, Arthur Merlin games, symmetric Boolean functions, property testing, communication complexity, derandomizing polynomial identity testing, tensor rank, sum of square roots

CITATION

"[Front cover]",

*2012 IEEE 27th Conference on Computational Complexity*, vol. 00, no. , pp. C1, 2011, doi:10.1109/CCC.2011.42