The Community for Technology Leaders
2012 IEEE 27th Conference on Computational Complexity (1996)
Philadelphia, PA
May 24, 1996 to May 27, 1996
ISBN: 0-8186-7386-9
TABLE OF CONTENTS

Foreword (PDF)

pp. viii
Session 1—Chair: Birgit Jenner

An Isomorphism Theorem for Circuit Complexity (Abstract)

Eric Allender , Rutgers University
Manindra Agrawal , Universitaet Ulm
pp. 2

Nondeterministic NC1 Computation (Abstract)

Heribert Vollmer , Universitaet Wuerzburg
Herve Caussinus , Universite de Montreal
Pierre McKenzie , Universite de Montreal
Denis Therien , McGill U, Montreal
pp. 12
Session 2—Chair: Mitsunori Ogihara

Collapsing Oracle-Tape Hierarchies (Abstract)

Georg Gottlob , Technische Universitaet Wien
pp. 33
Session 3—Chair: David Zuckerman

Extracting Randomness: How and Why - A survey (Abstract)

Noam Nisan , Institute of Computer Science Hebrew University Jerusalem, Israel
pp. 44
Session 4—Chair: Carsten Lund

Error Reduction by Parallel Repetition - A Negative Result (Abstract)

Uriel Feige , The Weizmann Institute
Oleg Verbitsky , Lviv University
pp. 70

Deciding The Vapnik-Chervonenkis Dimension Is Sigma_3-Complete (Abstract)

Marcus Schaefer , Department of Computer Science, The University of Chicago
pp. 77

VC Dimension in Circuit Complexity (Abstract)

Pascal Koiran , LIP, Ecole Normale Superieure de Lyon - CNRS
pp. 81
Session 5—Chair: Jin-Yi-Cai

Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L (Abstract)

Dieter Van Melkebeek , Department of Computer Science, The University of Chicago
pp. 88

L-Printable Sets (Abstract)

Lance Fortnow , University of Chicago
Judy Goldsmith , University of Kentucky
Matthew A. Levy , University of Kentucky
Stephen Mahaney , Rutgers University
pp. 97
Session 6—Chair: Luc Lonpre

Hierarchies of Circuit Classes that are Closed Under Complement (Abstract)

V Vinay , Indian Institute of Science
pp. 108

Succinct Representation, Leaf Languages, and Projection Reductions (Abstract)

Helmut Veith , Technische Universitaet Wien Institut fuer Informationssysteme
pp. 118
Session 7—Chair: Jin-Yi-Cai

On The Measure Of Two-Dimensional Regions With Polynomial-Time Computable Boundaries (Abstract)

Ker-I Ko , Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA
K. Weihrauch , Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA
pp. 150
Session 9—Chair: Jack Lutz

On Positive P (Abstract)

Clemens Lautemann , Johannes Gutenberg-Universitat
Thomas Schwentick , Johannes Gutenberg-Universitat
Iain A. Stewart , University College of Swansea
pp. 162

A Comparison of Weak Completeness Notions (Abstract)

Elvira Mayordomo , Universidad de Zaragoza
Xizhong Zheng , Deptment of Mathematics, Nanjing University
Klaus Ambos-Spies , Universitaet Heidelberg
pp. 171
Session 10—Chair: Jack Lutz
Session 11—Chair: Mitsunori Ogihara

Much Ado about Functions (Abstract)

Alan L. Selman , State University of New York at Buffalo
pp. 198

Inverting Onto Functions (Abstract)

Ashish V. Naik , University of Chicago
Stephen A. Fenner , University of Southern Maine
Lance Fortnow , University of Chicago
John D. Rogers , Depaul University
pp. 213
Session 12—Chair: Jie Wang

A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP (Abstract)

Ashish V. Naik , University of Chicago
Alan L. Selman , State University of New York at Buffalo
pp. 224
Session 13—Chair: Kevin Compton

The complexity of knowledge representation (Abstract)

C.H. Papadimitriou , Comput. Sci. Div., California Univ., Berkeley, CA, USA
pp. 244

Complements of multivalued functions (Abstract)

S. Homer , Univ. of Southern Maine, Portland, ME, USA
S. Fenner , Univ. of Southern Maine, Portland, ME, USA
T. Thierauf , Univ. of Southern Maine, Portland, ME, USA
H. Vollmer , Univ. of Southern Maine, Portland, ME, USA
A.L. Selman , Univ. of Southern Maine, Portland, ME, USA
F. Green , Univ. of Southern Maine, Portland, ME, USA
pp. 260
Session 14—Chair: Luc Longpre

Zero Knowledge and the Chromatic Number (Abstract)

Joe Kilian , The Weizmann Institute
Uriel Feige , The Weizmann Institute
pp. 278

DNA models and algorithms for NP-complete problems (Abstract)

C. Tanguay , Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA
A. Condon , Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA
E. Bach , Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA
E. Glaser , Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA
pp. 290

Author Index (PDF)

pp. 307
108 ms
(Ver )