The Community for Technology Leaders
2012 IEEE 27th Conference on Computational Complexity (2004)
Amherst, Massachusetts
June 21, 2004 to June 24, 2004
ISSN: 1093-0159
ISBN: 0-7695-2120-7
TABLE OF CONTENTS

Preface (PDF)

pp. viii
Introduction

Preface (PDF)

pp. viii

Committees (PDF)

pp. ix

Awards (PDF)

pp. x
Session 1

Compression of Samplable Sources (Abstract)

Luca Trevisan , University of California at Berkeley
David Zuckerman , University of Texas
Salil Vadhan , Harvard University
pp. 1-14

Language Compression and Pseudorandom Generators (Abstract)

Troy Lee , CWI and University of Amsterdam
Dieter van Melkebeek , University of Wisconsin-Madison
Harry Buhrman , CWI and University of Amsterdam
pp. 15-28

On Pseudoentropy versus Compressibility (Abstract)

Hoeteck Wee , University of California at Berkeley
pp. 29-41
Session 2

Reductions between Disjoint NP-Pairs (Abstract)

Christian Glaßer , Universität Würzburg
Samik Sengupta , University at Buffalo
Alan L. Selman , University at Buffalo
pp. 42-53

Relativized NP Search Problems and Propositional Proof Systems (Abstract)

Joshua Buresh-Oppenheim , University of Toronto
Tsuyoshi Morioka , University of Toronto
pp. 54-67

The Complexity of Treelike Systems over λ-Local Formulae (Abstract)

Nicola Galesi , Universitat Politécnica de Catalunya
Neil Thapen , University of Toronto
pp. 68-74
Session 3

Lower Bounds for Testing Bipartiteness in Dense Graphs (Abstract)

Andrej Bogdanov , University of California at Berkeley
Luca Trevisan , University of California at Berkeley
pp. 75-81

Solvable Group Isomorphism is (almost) in NP ∩ CoNP (Abstract)

Jacobo Torán , Universität Ulm
V. Arvind , Institute of Mathematical Sciences
pp. 91-103

Small Spans in Scaled Dimension (Abstract)

John M. Hitchcock , University of Wyoming
pp. 104-112
Session 4

Computing in Fault Tolerance Broadcast Networks (Abstract)

Ilan Newman , University of Haifa
pp. 113-122

Some Results on Majority Quantifiers over Words (Abstract)

Klaus-Jörn Lange , Eberhard-Karls-Universität Tübingen
pp. 123-129

Separating Complexity Classes Using Structural Properties (Abstract)

Leen Torenvliet , University of Amsterdam
Harry Buhrman , Centrum voor Wiskunde en Informatica
pp. 130-138
Session 5

Parameterized Complexity of Constraint Satisfaction Problems (Abstract)

Dániel Marx , Budapest University of Technology and Economics
pp. 139-149

Tight Lower Bounds for Certain Parameterized NP-Hard Problems (Abstract)

Ge Xia , Texas A&M University
Jianer Chen , Texas A&M University
Xiuzhen Huang , Texas A&M University
Benny Chor , Tel-Aviv University
David Juedes , Ohio University
Mike Fellows , University of Newcastle
Iyad Kanj , DePaul University
pp. 150-160

The Complexity of the Covering Radius Problem on Lattices and Codes (Abstract)

Oded Regev , Tel-Aviv University
Venkatesan Guruswami , University of Washington
Daniele Micciancio , University of California at San Diego
pp. 161-173
Session 6

Dimension, Entropy Rates, and Compression (Abstract)

N. V. Vinodchandran , University of Nebraska-Lincoln
John M. Hitchcock , University of Wyoming
pp. 174-183

Properties of NP-Complete Sets (Abstract)

A. Pavan , Iowa State University
Christian Gla?er , Universit?t W?rzburg
Samik Sengupta , University at Buffalo
Alan L. Selman , University at Buffalo
pp. 184-197

Partial Bi-immunity and NP-Completeness (Abstract)

N. V. Vinodchandran , University of Nebraska-Lincoln
John M. Hitchcock , University of Wyoming
A. Pavan , Iowa State University
pp. 198-203
Session 7

Abelian Permutation Group Problems and Logspace Counting Classes (Abstract)

V. Arvind , Institute ofMathematical Sciences
T.C. Vijayaraghavan , Institute ofMathematical Sciences
pp. 204-214

Deterministic Polynomial Identity Testing in Non-Commutative Models (Abstract)

Amir Shpilka , Weizmann Institute of Science
Ran Raz , Weizmann Institute of Science
pp. 215-222
Session 8

Consequences and Limits of Nonlocal Strategies (Abstract)

John Watrous , University of Calgary
Richard Cleve , University of Calgary
Benjamin Toner , California Institute of Technology
Peter H? , University of Calgary
pp. 236-249

Multiparty Quantum Coin Flipping (Abstract)

Hein Röhrig , U. of Calgary
Andris Ambainis , IAS and U. of Latvia
Harry Buhrman , CWI and U. of Amsterdam
Yevgeniy Dodis , New York University
pp. 250-259

On the Power of Quantum Proofs (Abstract)

Ran Raz , Weizmann Institute of Science
Amir Shpilka , Weizmann Institute of Science
pp. 260-274

Quantum Arthur-Merlin Games (Abstract)

Chris Marriott , University of Calgary
John Watrous , University of Calgary
pp. 275-285
Session 9

Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go? (Abstract)

Andrew C. Yao , Princeton University
Shengyu Zhang , Princeton University
Xiaoming Sun , Tsinghua University
pp. 286-293

Limitations of Quantum Advice and One-Way Communication (Abstract)

Scott Aaronson , University of California at Berkeley
pp. 320-332
Author Index

Author Index (PDF)

pp. 333
192 ms
(Ver 3.3 (11022016))