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

21st Annual IEEE Conference on Computational Complexity (CCC'06)

July 16 2006 to July 20 2006

Prague

Table of Contents

Introduction
PrefaceFreely available from IEEE.pp. viii
21st Annual IEEE Conference on Computational Complexity - TitleFreely available from IEEE.pp. i-iii
21st Annual IEEE Conference on Computational Complexity - CopyrightFreely available from IEEE.pp. iv-iv
21st Annual IEEE Conference on Computational Complexity - TOCFreely available from IEEE.pp. v-vii
Introduction
CommitteesFreely available from IEEE.pp. ix
Introduction
ReviewersFreely available from IEEE.pp. x-x
Introduction
AwardsFull-text access may be available. Sign in or learn about subscription options.pp. xi
Session 1
Godel and ComputationsFull-text access may be available. Sign in or learn about subscription options.pp. 3-5
by Pavel Pudlak
Session 2
Polynomial Identity Testing for Depth 3 CircuitsFull-text access may be available. Sign in or learn about subscription options.pp. 9-17
by Neeraj Kayal, Nitin Saxena
Session 2
Every Linear Threshold Function has a Low-Weight ApproximatorFull-text access may be available. Sign in or learn about subscription options.pp. 18-32
by Rocco A. Servedio
Session 3
Constructions of Low-Degree and Error-Correcting \in-Biased GeneratorsFull-text access may be available. Sign in or learn about subscription options.pp. 33-45
by Amir Shpilka
Session 3
How to Get More Mileage from Randomness ExtractorsFull-text access may be available. Sign in or learn about subscription options.pp. 46-60
by Ronen Shaltiel
Session 3
Exposure-Resilient ExtractorsFull-text access may be available. Sign in or learn about subscription options.pp. 61-72
by Marius Zimand
Session 4
Making Hard Problems HarderFull-text access may be available. Sign in or learn about subscription options.pp. 73-87
by Joshua Buresh-Oppenheim, Rahul Santhanam
Session 4
Distinguishing SAT from Polynomial-Size Circuits, through Black-Box QueriesFull-text access may be available. Sign in or learn about subscription options.pp. 88-95
by Albert Atserias
Session 4
Parallel Repetition of Zero-Knowledge Proofs and the Possibility of Basing Cryptography on NP-HardnessFull-text access may be available. Sign in or learn about subscription options.pp. 96-110
by Rafael Pass
Session 5
Applications of the Sum-Product Theorem in Finite FieldsFull-text access may be available. Sign in or learn about subscription options.pp. 111
by Avi Wigderson
Session 6
Constructing Ramsey Graphs from Boolean Function RepresentationsFull-text access may be available. Sign in or learn about subscription options.pp. 115-128
by Parikshit Gopalan
Session 6
A Generic Time Hierarchy for Semantic Models with One Bit of AdviceFull-text access may be available. Sign in or learn about subscription options.pp. 129-144
by Dieter van Melkebeek, Konstantin Pervyshev
Session 7
Hardness of the Covering Radius Problem on LatticesFull-text access may be available. Sign in or learn about subscription options.pp. 145-158
by Ishay Haviv, Oded Regev
Session 7
A 3-Query Non-Adaptive PCP with Perfect CompletenessFull-text access may be available. Sign in or learn about subscription options.pp. 159-169
by Subhash Khot, Rishi Saket
Session 7
New Lower Bounds for Vertex Cover in the Lovasz-Schrijver HierarchyFull-text access may be available. Sign in or learn about subscription options.pp. 170-182
by Iannis Tourlakis
Session 8
FO[\le]-UniformityFull-text access may be available. Sign in or learn about subscription options.pp. 183-189
by Christoph Behl, Klaus-Jorn Lange
Session 8
Circuit Lower Bounds via Ehrenfeucht-Fraisse GamesFull-text access may be available. Sign in or learn about subscription options.pp. 190-201
by Michal Koucky, Clemens Lautemann, Sebastian Poloczek, Denis Therien
Session 8
On Modular Counting with PolynomialsFull-text access may be available. Sign in or learn about subscription options.pp. 202-212
by Kristoffer Arnsfelt Hansen
Session 9
Learning Monotone Decision Trees in Polynomial TimeFull-text access may be available. Sign in or learn about subscription options.pp. 213-225
by Ryan O' Donnell, Rocco A. Servedio
Session 9
Optimal Hardness Results for Maximizing Agreements with MonomialsFull-text access may be available. Sign in or learn about subscription options.pp. 226-236
by Vitaly Feldman
Session 10
Minimizing DNF Formulas and AC^0_d Circuits Given a Truth TableFull-text access may be available. Sign in or learn about subscription options.pp. 237-251
by Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael Saks
Session 10
A Duality between Clause Width and Clause Density for SATFull-text access may be available. Sign in or learn about subscription options.pp. 252-260
by Chris Calabro, Russell Impagliazzo, Ramamohan Paturi
Session 11
QMA/qpoly \subseteq PSPACE/poly: De-Merlinizing Quantum ProtocolsFull-text access may be available. Sign in or learn about subscription options.pp. 261-273
by Scott Aaronson
Session 11
Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup ProblemFull-text access may be available. Sign in or learn about subscription options.pp. 274-287
by Pranab Sen
Session 11
Strengths and Weaknesses of Quantum FingerprintingFull-text access may be available. Sign in or learn about subscription options.pp. 288-298
by Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
Session 12
Grid Graph Reachability ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 299-313
by Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy
Session 12
An Isomorphism between Subexponential and Parameterized Complexity TheoryFull-text access may be available. Sign in or learn about subscription options.pp. 314-330
by Yijia Chen, Martin Grohe
Session 13
On the Complexity of Numerical AnalysisFull-text access may be available. Sign in or learn about subscription options.pp. 331-339
by Eric Allender, Peter Burgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
Session 13
Oracles Are Subtle But Not MaliciousFull-text access may be available. Sign in or learn about subscription options.pp. 340-354
by Scott Aaronson
Session 13
Derandomization of Probabilistic Auxiliary Pushdown Automata ClassesFull-text access may be available. Sign in or learn about subscription options.pp. 355-370
by H. Venkateswaran
Author Index
Author IndexFreely available from IEEE.pp. 371
Showing 38 out of 38