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

2011 IEEE 26th Annual Conference on Computational Complexity

June 8 2011 to June 11 2011

San Jose, California USA

ISSN: 1093-0159

ISBN: 978-0-7695-4411-3

Table of Contents

Papers
Title Page iFreely available from IEEE.pp. i
Papers
Title Page iiiFreely available from IEEE.pp. iii
Papers
[Copyright notice]Freely available from IEEE.pp. iv
Papers
Table of contentsFreely available from IEEE.pp. v-vii
Papers
PrefaceFreely available from IEEE.pp. viii
Papers
Program CommitteeFreely available from IEEE.pp. ix
Papers
Steering CommitteeFreely available from IEEE.pp. x
Papers
ReviewersFreely available from IEEE.pp. xi
Papers
Best Paper AwardsFreely available from IEEE.pp. xii
Papers
Improved Direct Product Theorems for Randomized Query ComplexityFull-text access may be available. Sign in or learn about subscription options.pp. 1-11
by Andrew Drucker
Papers
Making Branching Programs Oblivious Requires Superlogarithmic OverheadFull-text access may be available. Sign in or learn about subscription options.pp. 12-22
by Paul Beame, Widad Machmouchi
Papers
Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic GroupsFull-text access may be available. Sign in or learn about subscription options.pp. 23-33
by Ryan O'Donnell, Yi Wu, Yuan Zhou
Papers
Lower Bounds on Query Complexity for Testing Bounded-Degree CSPsFull-text access may be available. Sign in or learn about subscription options.pp. 34-44
by Yuichi Yoshida
Papers
Non-negatively Weighted #CSP: An Effective Complexity DichotomyFull-text access may be available. Sign in or learn about subscription options.pp. 45-54
by Jin-Yi Cai, Xi Chen, Pinyan Lu
Papers
Symmetric LDPC Codes are not Necessarily Locally TestableFull-text access may be available. Sign in or learn about subscription options.pp. 55-65
by Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu Sudan
Papers
Towards Lower Bounds on Locally Testable Codes via Density ArgumentsFull-text access may be available. Sign in or learn about subscription options.pp. 66-76
by Eli Ben-Sasson, Michael Viderman
Papers
Linear-Algebraic List Decoding of Folded Reed-Solomon CodesFull-text access may be available. Sign in or learn about subscription options.pp. 77-85
by Venkatesan Guruswami
Papers
Noisy Interpolation of Sparse Polynomials, and ApplicationsFull-text access may be available. Sign in or learn about subscription options.pp. 86-92
by Shubhangi Saraf, Sergey Yekhanin
Papers
Paris-Harrington TautologiesFull-text access may be available. Sign in or learn about subscription options.pp. 93-103
by Lorenzo Carlucci, Nicola Galesi, Massimo Lauria
Papers
Relativized Separations of Worst-Case and Average-Case Complexities for NPFull-text access may be available. Sign in or learn about subscription options.pp. 104-114
by Russell Impagliazzo
Papers
Non-uniform ACC Circuit Lower BoundsFull-text access may be available. Sign in or learn about subscription options.pp. 115-125
by Ryan Williams
Papers
Improved Constructions of Three Source ExtractorsFull-text access may be available. Sign in or learn about subscription options.pp. 126-136
by Xin Li
Papers
A New Approach to Affine Extractors and DispersersFull-text access may be available. Sign in or learn about subscription options.pp. 137-147
by Xin Li
Papers
Symmetry of Information and Bounds on Nonuniform Randomness Extraction via Kolmogorov ExtractorsFull-text access may be available. Sign in or learn about subscription options.pp. 148-156
by Marius Zimand
Papers
Near-Optimal and Explicit Bell Inequality ViolationsFull-text access may be available. Sign in or learn about subscription options.pp. 157-166
by Harry Buhrman, Oded Regev, Giannicola Scarpa, Ronald de Wolf
Papers
Symmetry-Assisted Adversaries for Quantum State GenerationFull-text access may be available. Sign in or learn about subscription options.pp. 167-177
by Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland
Papers
Approximation Algorithms for QMA-Complete ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 178-188
by Sevag Gharibian, Julia Kempe
Papers
On Arthur Merlin Games in Communication ComplexityFull-text access may be available. Sign in or learn about subscription options.pp. 189-199
by Hartmut Klauck
Papers
On the Minimal Fourier Degree of Symmetric Boolean FunctionsFull-text access may be available. Sign in or learn about subscription options.pp. 200-209
by Amir Shpilka, Avishay Tal
Papers
Property Testing Lower Bounds via Communication ComplexityFull-text access may be available. Sign in or learn about subscription options.pp. 210-220
by Eric Blais, Joshua Brody, Kevin Matulef
Papers
Pseudorandomness for Permutation and Regular Branching ProgramsFull-text access may be available. Sign in or learn about subscription options.pp. 221-231
by Anindya De
Papers
Pseudorandom Generators for Combinatorial CheckerboardsFull-text access may be available. Sign in or learn about subscription options.pp. 232-242
by Thomas Watson
Papers
Bounded-Depth Circuits Cannot Sample Good CodesFull-text access may be available. Sign in or learn about subscription options.pp. 243-251
by Shachar Lovett, Emanuele Viola
Papers
k-Independent Gaussians Fool Polynomial Threshold FunctionsFull-text access may be available. Sign in or learn about subscription options.pp. 252-261
by Daniel M. Kane
Papers
Explicit Dimension Reduction and Its ApplicationsFull-text access may be available. Sign in or learn about subscription options.pp. 262-272
by Zohar S. Karnin, Yuval Rabani, Amir Shpilka
Papers
Derandomizing Polynomial Identity Testing for Multilinear Constant-Read FormulaeFull-text access may be available. Sign in or learn about subscription options.pp. 273-282
by Matthew Anderson, Dieter van Melkebeek, Ilya Volkovich
Papers
Tensor Rank: Some Lower and Upper BoundsFull-text access may be available. Sign in or learn about subscription options.pp. 283-291
by Boris Alexeev, Michael A. Forbes, Jacob Tsimerman
Papers
On the Sum of Square Roots of Polynomials and Related ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 292-299
by Neeraj Kayal, Chandan Saha
Papers
Linear Systems over Finite Abelian GroupsFull-text access may be available. Sign in or learn about subscription options.pp. 300-308
by Arkadev Chattopadhyay, Shachar Lovett
Papers
Author IndexFreely available from IEEE.pp. 309
[Publisher Information]Freely available from IEEE.pp. 310-310
Showing 41 out of 41