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

20th Annual IEEE Conference on Computational Complexity (CCC'05)

June 11 2005 to June 15 2005

San Jose, CA, USA

Table of Contents

Introduction
PrefaceFreely available from IEEE.pp. viii
Twentieth Annual IEEE Conference on Computational Complexity - Title PageFreely available from IEEE.pp. i,ii,iii
Twentieth Annual IEEE Conference on Computational Complexity - Copyright PageFreely available from IEEE.pp. iv
Twentieth Annual IEEE Conference on Computational Complexity - Table of contentsFreely available from IEEE.pp. v,vi,vii
Awards [2 awards]Freely available from IEEE.pp. x-x
Session 1
On the Ring Isomorphism and Automorphism ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 2-12
by Neeraj Kayal, Nitin Saxena
Session 1
Bounded Color Multiplicity Graph Isomorphism is in the #L HierarchyFull-text access may be available. Sign in or learn about subscription options.pp. 13-27
by V. Arvind, Piyush P Kurur, T. C. Vijayaraghavan
Session 1
The Complexity of the Inertia and Some Closure Properties of GapLFull-text access may be available. Sign in or learn about subscription options.pp. 28-37
by Thanh Minh Hoang, Thomas Thierauf
Session 2 (Best Student Paper Award)
Better Time-Space Lower Bounds for SAT and Related ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 40-49
by Ryan Williams
Session 3
A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set DisjointnessFull-text access may be available. Sign in or learn about subscription options.pp. 52-66
by Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson
Session 3
Monotone Circuits for Weighted Threshold FunctionsFull-text access may be available. Sign in or learn about subscription options.pp. 67-75
by Amos Beimel, Enav Weinreb
Session 3
The Quantum Adversary Method and Classical Formula Size Lower BoundsFull-text access may be available. Sign in or learn about subscription options.pp. 76-90
by Sophie Laplante, Troy Lee, Mario Szegedy
Session 4
More on Noncommutative Polynomial Identity TestingFull-text access may be available. Sign in or learn about subscription options.pp. 92-99
by Andrej Bogdanov, Hoeteck Wee
Session 4
New Results on the Complexity of the Middle Bit of MultiplicationFull-text access may be available. Sign in or learn about subscription options.pp. 100-110
by Ingo Wegener, Philipp Woelfel
Session 5
On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric JuntasFull-text access may be available. Sign in or learn about subscription options.pp. 112-119
by Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi
Session 5
Short PCPs Verifiable in Polylogarithmic TimeFull-text access may be available. Sign in or learn about subscription options.pp. 120-134
by Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil Vadhan
Session 5
Tolerant Versus Intolerant Testing for Boolean PropertiesFull-text access may be available. Sign in or learn about subscription options.pp. 135-140
by Eldar Fischer, Lance Fortnow
Session 7
On the Hardness of Approximating Multicut and Sparsest-CutFull-text access may be available. Sign in or learn about subscription options.pp. 144-153
by Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar
Session 7
Hardness of Max 3SAT with No Mixed ClausesFull-text access may be available. Sign in or learn about subscription options.pp. 154-162
by Venkatesan Guruswami, Subhash Khot
Session 7
On the Sensitivity of Cyclically-Invariant Boolean FunctionsFull-text access may be available. Sign in or learn about subscription options.pp. 163-167
by Sourav Chakraborty
Session 8
On the Complexity of Hardness AmplificationFull-text access may be available. Sign in or learn about subscription options.pp. 170-182
by Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu
Session 8
On Constructing Parallel Pseudorandom Generators from One-Way FunctionsFull-text access may be available. Sign in or learn about subscription options.pp. 183-197
by Emanuele Viola
Session 8
Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric GatesFull-text access may be available. Sign in or learn about subscription options.pp. 198-209
by Emanuele Viola
Session 9 (Best Paper Award)
Pseudorandomness for Approximate Counting and SamplingFull-text access may be available. Sign in or learn about subscription options.pp. 212-226
by Ronen Shaltiel, Christopher Umans
Session 10
NP with Small AdviceFull-text access may be available. Sign in or learn about subscription options.pp. 228-234
by Lance Fortnow, Adam R. Klivans
Session 10
Average-Case Computations — Comparing AvgP, HP, and Nearly-PFull-text access may be available. Sign in or learn about subscription options.pp. 235-242
by Arfst Nickelsen, Birgit Schelm
Session 10
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard InstancesFull-text access may be available. Sign in or learn about subscription options.pp. 243-257
by Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
Session 11
Computationally Private Randomizing Polynomials and Their ApplicationsFull-text access may be available. Sign in or learn about subscription options.pp. 260-274
by Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
Session 11
A Geometric Approach to Information-Theoretic Private Information RetrievalFull-text access may be available. Sign in or learn about subscription options.pp. 275-284
by David Woodruff, Sergey Yekhanin
Session 11
Prior Entanglement, Message Compression and Privacy in Quantum CommunicationFull-text access may be available. Sign in or learn about subscription options.pp. 285-296
by Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
Session 12
Topology Inside NC¹Full-text access may be available. Sign in or learn about subscription options.pp. 298-307
by Eric Allender, Samir Datta, Sambuddha Roy
Session 12
Toward a Model for Backtracking and Dynamic ProgrammingFull-text access may be available. Sign in or learn about subscription options.pp. 308-322
by Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen, Toniann Pitassi
Session 12
On the Complexity of Succinct Zero-Sum GamesFull-text access may be available. Sign in or learn about subscription options.pp. 323-332
by Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans
Session 13
Upper bounds for quantum interactive proofs with competing proversFull-text access may be available. Sign in or learn about subscription options.pp. 334-343
by G. Gutoski
Session 13
On the Hardness of Distinguishing Mixed-State Quantum ComputationsFull-text access may be available. Sign in or learn about subscription options.pp. 344-354
by Bill Rosgen, John Watrous
Showing 35 out of 35