CSDL - Proceedings C

Committees (PDF)

pp. ix

Ron Book Prize for Best Student Paper (PDF)

pp. x

INVITED TALK

Time-Space Tradeoff Lower Bounds for Non-Uniform Computation

SESSION 1

Time-Space Tradeoffs for Nondeterministic Computation (Abstract)

Lance Fortnow, NEC Research Institute

Dieter Van Melkebeek, DIMACS

pp. 2

PDF

A Lower Bound for the Shortest Path Problem (Abstract)

Ketan Mulmuley, University of Chicago and Indian Institute of Technology

Pradyut Shah, University of Chicago

pp. 14

PDF

Time-Space Lower Bounds for SAT on Uniform and Non-Uniform Machines (Abstract)

Iannis Tourlakis, University of Toronto

pp. 22

PDF

SESSION 2

Oliver Giel (Abstract)

pp. 36

PDF

The Communication Complexity of Enumeration, Elimination, and Selection (Abstract)

Andris Ambainis, University of California at Berkeley

Harry Buhrman, CWI

William Gasarch, University of Maryland at College Park

Bala Kalyanasundaram, Georgetown University

Leen Torenvliet, University of Amsterdam

pp. 44

PDF

The Query Complexity of Order-Finding (Abstract)

Richard Cleve, University of Calgary

pp. 54

PDF

SESSION 3

On the Complexity of Some Problems on Groups Input as Multiplication Tables (Abstract)

David Mix Barrington, University of Massachusetts at Amherst

Peter Kadau, Universit?t Tubingen

Klaus-Jorn Lange, Universit?t Tubingen

Pierre McKenzie, Universit? de Montr?al

pp. 62

PDF

The Complexity of Tensor Calculus (Abstract)

Carsten Damm, Georg-August-Universit?t G?ttingen

Markus Holzer, Universit? de Montr?al

Pierre McKenzie, Universit? de Montr?al

pp. 70

PDF

The Complexity of Verifying the Characteristic Polynomial and Testing Similarity (Abstract)

Thanh Minh Hoang, Universit?t Ulm

Thomas Thierauf, Universit?t Ulm

pp. 87

PDF

SESSION 4

A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture (Abstract)

Jeff Kahn, Rutgers University

Michael Saks, Rutgers University

Cliff Smyth, Rutgers University

pp. 98

PDF

Computational Complexity and Phase Transitions (Abstract)

Gabriel Istrate, Los Alamos National Laboratory

pp. 104

PDF

An Application of Matroid Theory to the SAT Problem (Abstract)

Oliver Kullmann, University of Toronto

pp. 116

PDF

SESSION 5

New Bounds for the Language Compression Problem (Abstract)

pp. 126

PDF

Combinatorial Interpretation of Kolmogorov Complexity (Abstract)

Andrei Romashchenko, Moscow State University

Nikolai Vereshchagin, Moscow State University

Alexander Shen, Institute of Problems of Information Transmission

pp. 131

PDF

Independent Minimum Length Programs to Translate between Given Strings (Abstract)

Nikolai K. Vereshchagin, Moscow State University

Michael V. Vyugin, Moscow State University

pp. 138

PDF

TUTORIAL 1

A Survey of Optimal PCP Characterizations of NP (Abstract)

Luca Trevisan, Columbia University

pp. 146

PDF

SESSION 6

Easiness Assumptions and Hardness Tests: Trading Time for Zero Error (Abstract)

Valentine Kabanets, University of Toronto

pp. 150

PDF

Dimension in Complexity Classes (Abstract)

Jack H. Lutz, Iowa State University

pp. 158

PDF

Average Case Complexity of Unbounded Fanin Circuits (Abstract)

Andreas Jakoby, University of Toronto

Rüdiger Reischuk, Med. Universit?t zu L?

pp. 170

PDF

SESSION 7

On the Hardness of 4-Coloring a 3-Colorable Graph (Abstract)

Venkatesan Guruswami, Massachusetts Institute of Technology

Sanjeev Khanna, University of Pennsylvania

pp. 188

PDF

Deciding the K-Dimension is PSPACE-Complete (Abstract)

Marcus Schaefer, DePaul University

pp. 198

PDF

Integer Circuit Evaluation is PSPACE-Complete (Abstract)

Ke Yang, Carnegie Mellon University

pp. 204

PDF

SESSION 8

A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition (Abstract)

Pavol Duri?, University of Technology at Aachen

Juraj Hromkovic, University of Technology at Aachen

Katsushi Inoue, Yamaguchi University

pp. 214

PDF

On the Complexity of Intersecting Finite State Automata (Abstract)

George Karakostas, Princeton University

Anastasios Viglas, Princeton University

Richard J. Lipton, Princeton University and Telcordia Applied Research

pp. 229

PDF

On the Complexity of the Monotonicity Verification (Abstract)

Andrei A. Voronenko, Moscow State University

pp. 235

PDF

TUTORIAL 2

What Complexity and Cryptography Can Teach Each Other

SESSION 9

Quantum Kolmogorov Complexity (Abstract)

Andre Berthiaume, DePaul University

Wilm Van Dam, University of Oxford

Sophie Laplante, Universite Paris Sud

pp. 240

PDF

On the Complexity of Quantum ACC (Abstract)

Frederic Green, Clark University

Steven Homer, Boston University

Christopher Pollett, University of California at Los Angeles

pp. 250

PDF

Three Approaches to the Quantitative Definition of Information in an Individual Pure Quantum State (Abstract)

Paul Vitanyi

pp. 263

PDF

Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity (Abstract)

Ronald de Wolf, Centrum voor Wiskunde en Informatica

pp. 271

PDF

Author Index (PDF)

pp. 279