The Community for Technology Leaders
2012 IEEE 27th Conference on Computational Complexity (2005)
San Jose, CA
June 11, 2005 to June 15, 2005
ISSN: 1093-0159
ISBN: 0-7695-2364-1
TABLE OF CONTENTS
Introduction

Preface (PDF)

pp. viii

Committees (PDF)

pp. ix

Awards (PDF)

pp. x
Session 1

On the Ring Isomorphism and Automorphism Problems (Abstract)

Nitin Saxena , National University of Singapore and Indian Institute of Technology at Kanpur
Neeraj Kayal , National University of Singapore and Indian Institute of Technology at Kanpur
pp. 2-12

Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy (Abstract)

Piyush P Kurur , Institute of Mathematical Sciences
V. Arvind , Institute of Mathematical Sciences
T. C. Vijayaraghavan , Institute of Mathematical Sciences
pp. 13-27
Session 2 (Best Student Paper Award)
Session 3

A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness (Abstract)

Paul Beame , University of Washington
Toniann Pitassi , University of Toronto
Nathan Segerlind , University of Washington
Avi Wigderson , Institute for Advanced Study
pp. 52-66

Monotone Circuits for Weighted Threshold Functions (Abstract)

Enav Weinreb , Ben-Gurion University
Amos Beimel , Ben-Gurion University
pp. 67-75

The Quantum Adversary Method and Classical Formula Size Lower Bounds (Abstract)

Mario Szegedy , Rutgers University
Sophie Laplante , Université Paris-Sud
Troy Lee , CWI and University of Amsterdam
pp. 76-90
Session 4

More on Noncommutative Polynomial Identity Testing (Abstract)

Hoeteck Wee , University of California at Berkeley
Andrej Bogdanov , University of California at Berkeley
pp. 92-99

New Results on the Complexity of the Middle Bit of Multiplication (Abstract)

Ingo Wegener , University Dortmund
Philipp Woelfel , University Dortmund
pp. 100-110
Session 5

On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas (Abstract)

Aranyak Mehta , Georgia Institute of Technology
Nisheeth K. Vishnoi , IBM India Research Lab
Richard J. Lipton , Georgia Institute of Technology
Evangelos Markakis , Georgia Institute of Technology
pp. 112-119

Short PCPs Verifiable in Polylogarithmic Time (Abstract)

Oded Goldreich , Weizmann Institute of Science
Eli Ben-Sasson , Technion and Toyota Technological Institute at Chicago
Salil Vadhan , Harvard University
Prahladh Harsha , Microsoft Research
Madhu Sudan , Massachusetts Institute of Technology
pp. 120-134

Tolerant Versus Intolerant Testing for Boolean Properties (Abstract)

Lance Fortnow , University of Chicago
Eldar Fischer , Technion — Israel Institute of Technology
pp. 135-140
Session 6 (Invited Lecture)
Session 7

On the Hardness of Approximating Multicut and Sparsest-Cut (Abstract)

Robert Krauthgamer , IBM Almaden Research Center
Yuval Rabani , Technion-Israel Institute of Technology, Cornell University, IBM Almaden Research Center and University of California at Los Angeles
Shuchi Chawla , Carnegie Mellon University
D. Sivakumar , IBM Almaden Research Center
Ravi Kumar , IBM Almaden Research Center
pp. 144-153

Hardness of Max 3SAT with No Mixed Clauses (Abstract)

Venkatesan Guruswami , University of Washington
Subhash Khot , Georgia Institute of Technology
pp. 154-162
Session 8

On the Complexity of Hardness Amplification (Abstract)

Hsin-Lung Wu , National Chiao Tung University
Chi-Jen Lu , Academia Sinica
Shi-Chun Tsai , National Chiao Tung University
pp. 170-182
Session 9 (Best Paper Award)

Pseudorandomness for Approximate Counting and Sampling (Abstract)

Ronen Shaltiel , University of Haifa
Christopher Umans , California Institute of Technology
pp. 212-226
Session 10

NP with Small Advice (Abstract)

Lance Fortnow , University of Chicago
Adam R. Klivans , University of Texas at Austin
pp. 228-234

Average-Case Computations — Comparing AvgP, HP, and Nearly-P (Abstract)

Birgit Schelm , Universität Hannover
Arfst Nickelsen , Technische Universität Berlin
pp. 235-242

If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances (Abstract)

Dan Gutfreund , Hebrew University of Jerusalem
Amnon Ta-Shma , Tel-Aviv University
Ronen Shaltiel , University of Haifa
pp. 243-257
Session 11

A Geometric Approach to Information-Theoretic Private Information Retrieval (Abstract)

Sergey Yekhanin , Massachusetts Institute of Technology
David Woodruff , Massachusetts Institute of Technology
pp. 275-284

Prior Entanglement, Message Compression and Privacy in Quantum Communication (Abstract)

Jaikumar Radhakrishnan , Tata Institute of Fundamental Research and Toyota Technological Institute
Rahul Jain , University of California at Berkeley
Pranab Sen , University of Waterloo
pp. 285-296
Session 12

Topology Inside NC¹ (Abstract)

Eric Allender , Rutgers University
Sambuddha Roy , Rutgers University
Samir Datta , Chennai Mathematical Institute
pp. 298-307

Toward a Model for Backtracking and Dynamic Programming (Abstract)

Russell Impagliazzo , University of California at San Diego and Institute for Advanced Study in Princeton
Joshua Buresh-Oppenheim , University of California at San Diego
Michael Alekhnovich , Institute for Advanced Study in Princeton
Toniann Pitassi , University of Toronto and Institute for Advanced Study in Princeton
Allan Borodin , University of Toronto
Avner Magen , University of Toronto
pp. 308-322

On the Complexity of Succinct Zero-Sum Games (Abstract)

Valentine Kabanets , Simon Fraser University
Lance Fortnow , University of Chicago
Russell Impagliazzo , University of California at San Diego
Christopher Umans , California Institute of Technology
pp. 323-332
Session 13

On the Hardness of Distinguishing Mixed-State Quantum Computations (Abstract)

Bill Rosgen , University of Alberta
John Watrous , University of Calgary
pp. 344-354
Author Index

Author Index (PDF)

pp. 355
100 ms
(Ver )