The Community for Technology Leaders
2012 IEEE 27th Conference on Computational Complexity (1997)
Ulm GERMANY
June 24, 1997 to June 27, 1997
ISSN: 1093-0159
ISBN: 0-8186-7907-7
TABLE OF CONTENTS

Foreword (PDF)

pp. viii
Session Chair: Josk Balcazar

Six Hypotheses in Search of a Theorem (Abstract)

Leen Torenvliet , University of Amsterdam
pp. 2

Inequalities for Shannon entropies and Kolmogorov Complexities (Abstract)

A. Shen , Tech. Univ. Berlin, Germany
N.K. Vereshchagin , Tech. Univ. Berlin, Germany
A.E. Romashchenko , Tech. Univ. Berlin, Germany
D. Hammer , Tech. Univ. Berlin, Germany
pp. 13

Circuits Over PP and PL (Abstract)

Bin Fu , Yale University
Richard Beigel , University of Maryland at College Park
pp. 24

The General Notion of a Dot-Operator (Abstract)

Riccardo Silvestri , Universita' di Roma ''La Sapienza''
Bernd Borchert , Universitat Heidelberg
pp. 36

Reversible Space Equals Deterministic Space (Abstract)

Alain Tapp , Universite de Montreal
Pierre McKenzie , Universite de Montreal
Klaus-Jorn Lange , Universitat Tubingen
pp. 45
Session 2

Polynomial Vicinity Circuits and Nonlinear Lower Bounds (Abstract)

Kenneth W. Regan , State University of NY at Buffalo
pp. 61

LR(k) Testing is Average Case Complete (Abstract)

Christoph Karg , Universitaet Ulm
pp. 74
Session 3

Complexity and Expressive Power of Logic Programming (Abstract)

Andrei Voronkov , Uppsala University
Thomas Eiter , University of Giessen
Georg Gottlob , TU Vienna
Evgeny Dantsin , Steklov Institute of Mathematics at St. Petersburg
pp. 82

The Density of Weakly Complete Problems under Adaptive Reductions (Abstract)

Jack H. Lutz , Iowa State University
Yong Zhao , LANshark Systems
pp. 111

Separating NP-Completeness Notions Under Strong Hypotheses (Abstract)

K. Ambos-Spies , Math. Inst., Heidelberg Univ., Germany
L. Bentzien , Math. Inst., Heidelberg Univ., Germany
pp. 121

Undecidability Results For Low Complexity Degree Structures (Abstract)

R. Downey , Victoria Univ., Wellington, New Zealand
A. Nies , Victoria Univ., Wellington, New Zealand
pp. 128
Session 4

On TC/sup 0/, AC/sup 0/, and Arithmetic Circuits (Abstract)

S. Datta , Dept. of Comput. Sci., Indian Inst. of Technol., Kanpur, India
M. Agrawal , Dept. of Comput. Sci., Indian Inst. of Technol., Kanpur, India
E. Allender , Dept. of Comput. Sci., Indian Inst. of Technol., Kanpur, India
pp. 134

Upper and Lower Bounds for Some Depth-3 Circuit Classes (Abstract)

Alexis Maciel , University of Maryland
Richard Beigel , University of Maryland
pp. 149

Circuit Bottom Fan-in and Computational Power (Abstract)

Johan Hastad , Royal Institute of Technology
Liming Cai , Ohio University
Jianer Chen , Texas A&M University
pp. 158

A Lower Bound For Perceptrons And An Oracle Separation Of The PP/sup PH/ Hierarchy (Abstract)

C. Berg , Dept. of Numerical Anal. & Comput. Sci., R. Inst. of Technol., Stockholm, Sweden
S. Ulfberg , Dept. of Numerical Anal. & Comput. Sci., R. Inst. of Technol., Stockholm, Sweden
pp. 165
Session 5

On Operators of Higher Types (Abstract)

Heribert Vollmer , Universitaet Wuerzburg
Klaus W. Wagner , Universitaet Wuerzburg
pp. 174

Time Bounded Frequency Computations (Abstract)

Maren Hinrichs , Friedrich-Schiller-Universit"at Jena
Gerd Wechsung , Friedrich-Schiller-Universit"at Jena
pp. 185

Circuits And Expressions With Non-Associative Gates (Abstract)

A. Drisko , State Univ. of New York, Binghamton, NY, USA
J. Berman , State Univ. of New York, Binghamton, NY, USA
D. Therien , State Univ. of New York, Binghamton, NY, USA
F. Lemieu , State Univ. of New York, Binghamton, NY, USA
C. Moore , State Univ. of New York, Binghamton, NY, USA
pp. 193

A Nonadaptive NC Checker for Permutation Group Intersection (Abstract)

J. Toran , Universitat Ulm
V. Arvind , The Institute of Mathematical Sciences
pp. 204
Session 6

On Randomization In Online Computation (Abstract)

A. Borodin , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
R. El-Yaniv , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
pp. 226

Randomized Simultaneous Messages: Solution Of A Problem Of Yao In Communication Complexity (Abstract)

P.G. Kimmel , Dept. of Comput. Sci., Chicago Univ., IL, USA
L. Babai , Dept. of Comput. Sci., Chicago Univ., IL, USA
pp. 239

The Communication Complexity of the Universal Relation (Abstract)

Gabor Tardos , Mathematical Institute of the Hungarian Academy of Sciences and Institute for Advenced Study
Uri Zwick , Tel Aviv University
pp. 247
Session 7

A Short Guide To Approximation Preserving Reductions (Abstract)

P. Crescenzi , Dipt. di Sci. dell'Inf., Rome Univ., Italy
pp. 262

Tight Bound on Johnson's Algoritihm for Max-SAT (Abstract)

Jianer Chen , Texas A&M University
Donald K. Friesen , Texas A&M University
Hao Zheng , Texas A&M University
pp. 274

Constraint Satisfaction: The Approximability of Minimization Problems (Abstract)

Madhu Sudan , IBM Thomas J. Watson Research Center
Luca Trevisan , Universite de Geneve
Sanjeev Khanna , Bell Labs
pp. 282

A Note on the Bottleneck Counting Argument (Abstract)

Shi-Chun Tsai , National Chi-Nan International University
Janos Simon , University of Chicago
pp. 297

Author Index (PDF)

pp. 315
96 ms
(Ver )