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

Proceedings 17th IEEE Annual Conference on Computational Complexity

May 21 2002 to May 24 2002

Montreal, Quebec, Canada

Table of Contents

Proceedings 17th IEEE Annual Conference on Computational Complexity [front matter]Freely available from IEEE.
Resolution lower bounds for the weak pigeonhole principleFull-text access may be available. Sign in or learn about subscription options.pp. 1
by Ran Raz
Hard examples for bounded depth fregeFull-text access may be available. Sign in or learn about subscription options.pp. 2
by E. Ben-Sasson
PrefaceFreely available from IEEE.pp. ix
CommitteesFreely available from IEEE.pp. x
Ron Book Prize for Best Student PaperFull-text access may be available. Sign in or learn about subscription options.pp. xi
2002 Best Paper AwardFreely available from IEEE.pp. xii
Session 1: Joint Session with STOC 2002
Resolution Lower Bounds for the Weak Pigeonhole PrincipleFull-text access may be available. Sign in or learn about subscription options.pp. 0003
by Ran Raz
Session 1: Joint Session with STOC 2002
Hard Examples for Bounded Depth FregeFull-text access may be available. Sign in or learn about subscription options.pp. 0004
by E. Ben-Sasson
Session 1: Joint Session with STOC 2002
Relations between Average Case Complexity and Approximation ComplexityFull-text access may be available. Sign in or learn about subscription options.pp. 0005
by Uriel Feige
Session 1: Joint Session with STOC 2002
Vertex Cover on 4-Regular Hyper-graphs Is Hard to Approximate within 2 - \epsilonFull-text access may be available. Sign in or learn about subscription options.pp. 0006
by Jonas Holmerin
Session 2: Joint Session with STOC 2002
Improved Cryptographic Hash Functions with Worst-Case/Average-Case ConnectionFull-text access may be available. Sign in or learn about subscription options.pp. 0009
by Daniele Micciancio
Session 2: Joint Session with STOC 2002
Algorithmic Derandomization via Complexity TheoryFull-text access may be available. Sign in or learn about subscription options.pp. 0010
by D. Sivakumar
Session 2: Joint Session with STOC 2002
Pseudo-Random Generators for All HardnessesFull-text access may be available. Sign in or learn about subscription options.pp. 0011
by Christopher Umans
Session 3: Joint Session with STOC 2002
Randomness Conductors and Constant-Degree Lossless ExpandersFull-text access may be available. Sign in or learn about subscription options.pp. 0015
by Michael Capalbo, Omer Reingold, Salil Vadhan, Avi Wigderson
Session 3: Joint Session with STOC 2002
Expanders from Symmetric CodesFull-text access may be available. Sign in or learn about subscription options.pp. 0016
by R. Meshulam, A. Wigderson
Session 3: Joint Session with STOC 2002
The Complexity of Approximating the EntropyFull-text access may be available. Sign in or learn about subscription options.pp. 0017
by Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld
Session 3: Joint Session with STOC 2002
Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 0018
by Paul Beame, Erik Vee
Session 3: Joint Session with STOC 2002
On Communication over an Entanglement-Assisted Quantum ChannelFull-text access may be available. Sign in or learn about subscription options.pp. 0019
by Ashwin Nayak, Julia Salzman
Session 4: Joint Session with STOC 2002
Hardness Amplification within NPFull-text access may be available. Sign in or learn about subscription options.pp. 0023
by R. O'Donnell
3-MANIFOLD KNOT GENUS is NP-completeFull-text access may be available. Sign in or learn about subscription options.pp. 24-24
by I. Agol, J. Hass
Session 4: Joint Session with STOC 2002
On the Power of Unique 2-Prover 1-Round GamesFull-text access may be available. Sign in or learn about subscription options.pp. 0025
by Subhash Khot
Session 4: Joint Session with STOC 2002
Learnability beyond AC0Full-text access may be available. Sign in or learn about subscription options.pp. 0026
by J. Jackson, A. Klivans, R. Servedio
Session 5
Resolution Lower Bounds for Perfect Matching PrinciplesFull-text access may be available. Sign in or learn about subscription options.pp. 0029
by Alexander A. Razborov
Session 5
Resolution Width-Size Trade-offs for the Pigeon-Hole PrincipleFull-text access may be available. Sign in or learn about subscription options.pp. 0039
by Stefan Dantchev
Session 5
The Inapproximability of Lattice and Coding Problems with PreprocessingFull-text access may be available. Sign in or learn about subscription options.pp. 0044
by Uriel Feige, Daniele Micciancio
Session 5
Sampling Short Lattice Vectors and the Closest Lattice Vector ProblemFull-text access may be available. Sign in or learn about subscription options.pp. 0053
by Miklos Ajtai, Ravi Kumar, D. Sivakumar
Invited Address 1
The History of ComplexityFull-text access may be available. Sign in or learn about subscription options.pp. 0061
by Lance Fortnow
Session 6
The Correlation Between Parity and Quadratic Polynomials Mod 3Full-text access may be available. Sign in or learn about subscription options.pp. 0065
by Frederic Green
Session 6
Functions that have Read-Twice Constant Width Branching Programs are not Necessarily TestableFull-text access may be available. Sign in or learn about subscription options.pp. 0073
by Eldar Fischer, Ilan Newman
Session 6
On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited NondeterminismFull-text access may be available. Sign in or learn about subscription options.pp. 0080
by Philipp Woelfel
Session 7
Information Theory Methods in Communication ComplexityFull-text access may be available. Sign in or learn about subscription options.pp. 0093
by Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
Session 7
Extracting Quantum EntanglementFull-text access may be available. Sign in or learn about subscription options.pp. 0103
by Andris Ambainis, Adam Smith, Ke Yang
Session 7
Algebras of Minimal Rank over Perfect FieldsFull-text access may be available. Sign in or learn about subscription options.pp. 0113
by Markus Bläser
Invited Address 2
Rapid MixingFull-text access may be available. Sign in or learn about subscription options.pp. 0125
by Peter Winkler
Session 8
Pseudorandomness and Average-Case Complexity via Uniform ReductionsFull-text access may be available. Sign in or learn about subscription options.pp. 0129
by Luca Trevisan, Salil Vadhan
Session 8
Pseudo-Random Generators and Structure of Complete DegreesFull-text access may be available. Sign in or learn about subscription options.pp. 0139
by Manindra Agrawal
Session 8
Decoding Concatenated Codes using Soft InformationFull-text access may be available. Sign in or learn about subscription options.pp. 0148
by Venkatesan Guruswami, Madhu Sudan
Survey Talk 1
Arthur and Merlin in a Quantum WorldFull-text access may be available. Sign in or learn about subscription options.pp. 0161
by John Watrous
Session 9
Streaming Computation of Combinatorial ObjectsFull-text access may be available. Sign in or learn about subscription options.pp. 0165
by Ziv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel
Session 9
Lower Bounds for Linear Locally Decodable Codes and Private Information RetrievalFull-text access may be available. Sign in or learn about subscription options.pp. 0175
by Oded Goldreich, Howard Karloff, Leonard J. Schulman, Luca Trevisan
Session 9
Better Lower Bounds for Locally Decodable CodesFull-text access may be available. Sign in or learn about subscription options.pp. 0184
by Amit Deshpande, Rahul Jain, T. Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam
Session 9
Universal Arguments and their ApplicationsFull-text access may be available. Sign in or learn about subscription options.pp. 0194
by Boaz Barak, Oded Goldreich
Session 9
Author IndexFreely available from IEEE.pp. 0205
Showing 44 out of 44