The Community for Technology Leaders
2012 IEEE 27th Conference on Computational Complexity (2002)
Montreal, Canada
May 21, 2002 to May 24, 2002
ISBN: 0-7695-1468-5
TABLE OF CONTENTS

Preface (PDF)

pp. ix

Committees (PDF)

pp. x
Session 1: Joint Session with STOC 2002
Session 2: Joint Session with STOC 2002

Algorithmic Derandomization via Complexity Theory (PDF)

D. Sivakumar , IBM Almaden Research Center
pp. 0010
Session 3: Joint Session with STOC 2002

Randomness Conductors and Constant-Degree Lossless Expanders (PDF)

Avi Wigderson , Hebrew University at Jerusalem and Institute for Advanced Study
Omer Reingold , AT&T Labs
Michael Capalbo , Institute for Advanced Study
Salil Vadhan , Harvard University
pp. 0015

The Complexity of Approximating the Entropy (PDF)

Sanjoy Dasgupta , AT&T Labs-Research
Ravi Kumar , IBM Almaden Research Center
Ronitt Rubinfeld , NEC Research Institute
Tugkan Batu , University of Pennsylvania
pp. 0017

On Communication over an Entanglement-Assisted Quantum Channel (PDF)

Julia Salzman , Princeton University
Ashwin Nayak , California Institute of Technology
pp. 0019
Session 4: Joint Session with STOC 2002

3-MANIFOLD KNOT GENUS is NP-complete (PDF)

William Thurston , University of California at Davis
Ian Agol , University of Illinois at Chicago
Joel Hass , University of California at Davis
pp. 0024
Session 5

Resolution Lower Bounds for Perfect Matching Principles (Abstract)

Alexander A. Razborov , Institute for Advanced Study and Steklov Mathematical Institute
pp. 0029

The Inapproximability of Lattice and Coding Problems with Preprocessing (Abstract)

Uriel Feige , Weizmann Institute of Science
Daniele Micciancio , University of California at San Diego
pp. 0044

Sampling Short Lattice Vectors and the Closest Lattice Vector Problem (Abstract)

D. Sivakumar , IBM Almaden Research Center
Miklos Ajtai , IBM Almaden Research Center
Ravi Kumar , IBM Almaden Research Center
pp. 0053
Invited Address 1

The History of Complexity (PDF)

Lance Fortnow , NEC Research Institute
pp. 0061
Session 6

Functions that have Read-Twice Constant Width Branching Programs are not Necessarily Testable (Abstract)

Ilan Newman , University of Haifa and NEC Research Institute
Eldar Fischer , The Technion
pp. 0073
Session 7

Information Theory Methods in Communication Complexity (Abstract)

Ziv Bar-Yossef , University of California at Berkeley
Ravi Kumar , IBM Almaden Research Center
T. S. Jayram , IBM Almaden Research Center
D. Sivakumar , IBM Almaden Research Center
pp. 0093

Extracting Quantum Entanglement (Abstract)

Adam Smith , Massachusetts Institute of Technology
Ke Yang , Carnegie Mellon University
Andris Ambainis , Institute for Advanced Study
pp. 0103

Algebras of Minimal Rank over Perfect Fields (Abstract)

Markus Bläser , Universit?t Luebeck
pp. 0113
Invited Address 2

Rapid Mixing (PDF)

Peter Winkler , Bell Laboratories
pp. 0125
Session 8

Pseudorandomness and Average-Case Complexity via Uniform Reductions (Abstract)

Luca Trevisan , University of California at Berkeley
Salil Vadhan , Harvard University
pp. 0129

Pseudo-Random Generators and Structure of Complete Degrees (Abstract)

Manindra Agrawal , Indian Institute of Technology at Kanpur
pp. 0139

Decoding Concatenated Codes using Soft Information (Abstract)

Madhu Sudan , Massachusetts Institute of Technology
Venkatesan Guruswami , University of California at Berkeley
pp. 0148
Survey Talk 1

Arthur and Merlin in a Quantum World (PDF)

John Watrous , University of Calgary
pp. 0161
Session 9

Streaming Computation of Combinatorial Objects (Abstract)

Luca Trevisan , University of California at Berkeley
Omer Reingold , AT&T Labs - Research
Ronen Shaltiel , Weizmann Institute of Science
Ziv Bar-Yossef , University of California at Berkeley
pp. 0165

Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval (Abstract)

Oded Goldreich , Weizmann Institute of Science
Howard Karloff , AT&T Labs
Luca Trevisan , University of California at Berkeley
pp. 0175

Better Lower Bounds for Locally Decodable Codes (Abstract)

Amit Deshpande , Chennai Mathematical Institute
Satyanarayana V. Lokam , University of Michigan
Jaikumar Radhakrishnan , Tata Institute of Fundamental Research
Rahul Jain , Tata Institute of Fundamental Research
T. Kavitha , Tata Institute of Fundamental Research
pp. 0184

Universal Arguments and their Applications (Abstract)

Boaz Barak , Weizmann Institute of Science
Oded Goldreich , Weizmann Institute of Science
pp. 0194

Author Index (PDF)

pp. 0205
97 ms
(Ver )