The Community for Technology Leaders
2012 IEEE 27th Conference on Computational Complexity (2000)
Florence, Italy
July 4, 2000 to July 7, 2000
ISSN: 1093-0159
ISBN: 0-7695-0674-7
TABLE OF CONTENTS

Preface (PDF)

pp. viii

Committees (PDF)

pp. ix
SESSION 1

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
SESSION 2

Oliver Giel (Abstract)

pp. 36

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

Andris Ambainis , University of California at Berkeley
William Gasarch , University of Maryland at College Park
Leen Torenvliet , University of Amsterdam
Bala Kalyanasundaram , Georgetown University
pp. 44

The Query Complexity of Order-Finding (Abstract)

Richard Cleve , University of Calgary
pp. 54
SESSION 3

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

Pierre McKenzie , Universit? de Montr?al
David Mix Barrington , University of Massachusetts at Amherst
Klaus-Jorn Lange , Universit?t Tubingen
Peter Kadau , Universit?t Tubingen
pp. 62

The Complexity of Tensor Calculus (Abstract)

Carsten Damm , Georg-August-Universit?t G?ttingen
Pierre McKenzie , Universit? de Montr?al
Markus Holzer , Universit? de Montr?al
pp. 70
SESSION 4

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

Jeff Kahn , Rutgers University
Cliff Smyth , Rutgers University
Michael Saks , Rutgers University
pp. 98

Computational Complexity and Phase Transitions (Abstract)

Gabriel Istrate , Los Alamos National Laboratory
pp. 104
SESSION 5

Combinatorial Interpretation of Kolmogorov Complexity (Abstract)

Nikolai Vereshchagin , Moscow State University
Alexander Shen , Institute of Problems of Information Transmission
Andrei Romashchenko , Moscow State University
pp. 131
TUTORIAL 1
SESSION 6

Dimension in Complexity Classes (Abstract)

Jack H. Lutz , Iowa State University
pp. 158

Average Case Complexity of Unbounded Fanin Circuits (Abstract)

Andreas Jakoby , University of Toronto
Rüdiger Reischuk , Med. Universit?t zu L?
pp. 170
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

Integer Circuit Evaluation is PSPACE-Complete (Abstract)

Ke Yang , Carnegie Mellon University
pp. 204
SESSION 8

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

Juraj Hromkovic , University of Technology at Aachen
Katsushi Inoue , Yamaguchi University
Pavol Duri? , University of Technology at Aachen
pp. 214

On the Complexity of Intersecting Finite State Automata (Abstract)

Anastasios Viglas , Princeton University
Richard J. Lipton , Princeton University and Telcordia Applied Research
George Karakostas , Princeton University
pp. 229
SESSION 9

Quantum Kolmogorov Complexity (Abstract)

Wilm Van Dam , University of Oxford
Andre Berthiaume , DePaul University
Sophie Laplante , Universite Paris Sud
pp. 240

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

Author Index (PDF)

pp. 279
96 ms
(Ver )