The Community for Technology Leaders
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) (2007)
San Diego, California
June 13, 2007 to Mar. 16, 2007
ISSN: 1093-0159
ISBN: 0-7695-2780-9
TABLE OF CONTENTS

Preface (PDF)

pp. viii

The Communication Complexity of Correlation (Abstract)

Prahladh Harsha , Toyota Technological Institute, USA
Rahul Jain , Univ. of Waterloo, Canada
David McAllester , Toyota Technological Institute, USA
Jaikumar Radhakrishnan , Tata Institute of Fundamental Research, India
pp. 10-23
Introduction

Preface (PDF)

pp. viii

Committees (PDF)

pp. ix

Reviewers (PDF)

pp. xi
Wednesday, June 13

The Communication Complexity of Correlation (Abstract)

Prahladh Harsha , Toyota Technological Institute, USA
Rahul Jain , Univ. of Waterloo, Canada
David McAllester , Toyota Technological Institute, USA
Jaikumar Radhakrishnan , Tata Institute of Fundamental Research, India
pp. 10-23

On Computation and Communication with Small Bias (Abstract)

Harry Buhrman , CWI Amsterdamn and University of Amsterdam, Netherlands
Nikolay Vereshchagin , Moscow State University, Russia
Ronald de Wolf , CWI Amsterdam, Netherlands
pp. 24-32

Lower Bounds for Multi-Player Pointer Jumping (Abstract)

Amit Chakrabarti , Dartmouth College, USA
pp. 33-45

Low-Depth Witnesses are Easy to Find (Abstract)

Luis Antunes , U. Porto
Lance Fortnow , U. Chicago
Alexandre Pinto , U. Porto
Andre Souto , U. Porto
pp. 46-51

Bounded Queries and the NP Machine Hypothesis (Abstract)

Richard Chang , University of Maryland Baltimore County, USA
Suresh Purini , University of Maryland Baltimore County, USA
pp. 52-59

On C-Degrees, H-Degrees and T-Degrees (Abstract)

Wolfgang Merkle , Ruprecht-Karls-Universitat Heidelberg, Germany
Frank Stephan , National University of Singapore, Singapore
pp. 60-69
Thursday, June 14th

Time-Space Tradeoffs for Counting NP Solutions Modulo Integers (Abstract)

Ryan Williams , Carnegie Mellon University, USA
pp. 70-82

Halfspace Matrices (Abstract)

Alexander A. Sherstov , The University of Texas at Austin, USA
pp. 83-95

Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes (Abstract)

Venkatesan Guruswami , University of Washington, USA
Christopher Umans , California Institute of Technology, USA
Salil Vadhan , Harvard University, USA
pp. 96-108

Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems (Abstract)

Richard Cleve , University of Waterloo, Canada
William Slofstra , University of California, Berkeley, USA
Falk Unger , CWI, the Netherlands
Sarvagya Upadhyay , University of Waterloo, Canada
pp. 109-114

Quantum versus Classical Proofs and Advice (Abstract)

Scott Aaronson , University of Waterloo, Canada
Greg Kuperberg , UC Davis, USA
pp. 115-128

Quantum t-designs: t-wise Independence in the Quantum World (Abstract)

Andris Ambainis , University of Waterloo, Canada
Joseph Emerson , University of Waterloo, Canada
pp. 129-140

Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols (Abstract)

Emanuele Viola , Institute for Advanced Study, USA
Avi Wigderson , Institute for Advanced Study, USA
pp. 141-154

On Approximate Majority and Probabilistic Time (Abstract)

Emanuele Viola , Institute for Advanced Study, USA
pp. 155-168
Friday, June 15th

Understanding Parallel Repetition Requires Understanding Foams (Abstract)

Uriel Feige , Weizmann Institute, Israel; Microsoft Research
Guy Kindler , Weizmann Institute, Israel
Ryan O'Donnell , Carnegia Mellon University, USA
pp. 179-192

The Complexity of Polynomials and Their Coefficient Functions (Abstract)

Guillaume Malod , Universite de Mons-Hainaut, Belgium
pp. 193-204

Directed Planar Reachability is in Unambiguous Log-Space (Abstract)

Chris Bourke , University of Nebraska, Lincoln, USA
Raghunath Tewari , University of Nebraska, Lincoln, USA
N.V. Vinodchandran , University of Nebraska, Lincoln, USA
pp. 217-221

Parity Problems in Planar Graphs (Abstract)

Mark Braverman , University of Toronto
Raghav Kulkarni , University of Chicago
Sambuddha Roy , IBM India
pp. 222-235

S-T Connectivity on Digraphs with a Known Stationary Distribution (Abstract)

Kai-Min Chung , Harvard University, USA
Omer Reingold , Weizmann Institute of Science, Israel
Salil Vadhan , Harvard University, USA
pp. 236-249

On Parameterized Path and Chordless Path Problems (Abstract)

Yijia Chen , Shanghai Jiaotong University, China
Jorg Flum , Universitat Freiburg, Germany
pp. 250-263

Testing Properties of Constraint-Graphs (Abstract)

Shirley Halevy , University of Haifa, Israel
Oded Lachish , University of Haifa, Israel
Ilan Newman , University of Haifa, Israel
Dekel Tsur , Ben-Gurion University of the Negev, Israel
pp. 264-277

Efficient Arguments without Short PCPs (Abstract)

Yuval Ishai , Technion, Israel
Eyal Kushilevitz , Technion, Israel
Rafail Ostrovsky , UCLA, USA
pp. 278-291
Saturday, June 16th

Bases Collapse in Holographic Algorithms (Abstract)

Jin-Yi Cai , University of Wisconsin, USA
Pinyan Lu , Tsinghua University, China
pp. 292-304

On the Theory of Matchgate Computations (Abstract)

Jin-Yi Cai , University of Wisconsin, USA
Vinay Choudhary , University of Wisconsin, USA
Pinyan Lu , Tsinghua University, China
pp. 305-318

A New Interactive Hashing Theorem (Abstract)

Iftach Haitner , Weizmann Institute of Science, Israel
Omer Reingold , Weizmann Institute of Science, Israel
pp. 319-332

Limits on the Hardness of Lattice Problems in \ell _p Norms (Abstract)

Chris Peikert , SRI International, MIT, USA
pp. 333-346

On Heuristic Time Hierarchies (Abstract)

Konstantin Pervyshev , University of California, San Diego, USA
pp. 347-358
Author Index

Author Index (PDF)

pp. 359
130 ms
(Ver 3.3 (11022016))