Foreword

Committees and Acknowledgements (PDF)

pp. ix

Best Student Paper Award (PDF)

pp. x

Session Chair: Josk Balcazar

Six Hypotheses in Search of a Theorem (Abstract)

Harry Buhrman, CWI

Lance Fortnow, CWI

Leen Torenvliet, University of Amsterdam

pp. 2

PDF

Inequalities for Shannon entropies and Kolmogorov Complexities (Abstract)

D. Hammer, Tech. Univ. Berlin, Germany

A.E. Romashchenko, Tech. Univ. Berlin, Germany

A. Shen, Tech. Univ. Berlin, Germany

N.K. Vereshchagin, Tech. Univ. Berlin, Germany

pp. 13

PDF

Circuits Over PP and PL (Abstract)

Richard Beigel, University of Maryland at College Park

Bin Fu, Yale University

pp. 24

PDF

The General Notion of a Dot-Operator (Abstract)

Bernd Borchert, Universitat Heidelberg

Riccardo Silvestri, Universita' di Roma ''La Sapienza''

pp. 36

PDF

Reversible Space Equals Deterministic Space (Abstract)

Klaus-Jorn Lange, Universitat Tubingen

Pierre McKenzie, Universite de Montreal

Alain Tapp, Universite de Montreal

pp. 45

PDF

Session 2

Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability (Abstract)

Lance Fortnow, University of Chicago & CWI

pp. 52

PDF

Polynomial Vicinity Circuits and Nonlinear Lower Bounds (Abstract)

Kenneth W. Regan, State University of NY at Buffalo

pp. 61

PDF

A note on universal distributions for polynomial-time computable distributions (Abstract)

Rainer Schuler, University Ulm

pp. 69

PDF

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

Christoph Karg, Universitaet Ulm

pp. 74

PDF

Session 3

Complexity and Expressive Power of Logic Programming (Abstract)

Evgeny Dantsin, Steklov Institute of Mathematics at St. Petersburg

Thomas Eiter, University of Giessen

Georg Gottlob, TU Vienna

Andrei Voronkov, Uppsala University

pp. 82

PDF

Hyper-Polynomial Hierarchies and the NP-Jump (Abstract)

pp. 102

PDF

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

Jack H. Lutz, Iowa State University

Yong Zhao, LANshark Systems

pp. 111

PDF

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

PDF

Undecidability Results For Low Complexity Degree Structures (Abstract)

R. Downey, Victoria Univ., Wellington, New Zealand

A. Nies, Victoria Univ., Wellington, New Zealand

pp. 128

PDF

Session 4

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

M. Agrawal, Dept. of Comput. Sci., Indian Inst. of Technol., Kanpur, India

E. Allender, Dept. of Comput. Sci., Indian Inst. of Technol., Kanpur, India

S. Datta, Dept. of Comput. Sci., Indian Inst. of Technol., Kanpur, India

pp. 134

PDF

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

Richard Beigel, University of Maryland

Alexis Maciel, University of Maryland

pp. 149

PDF

Circuit Bottom Fan-in and Computational Power (Abstract)

Liming Cai, Ohio University

Jianer Chen, Texas A&M University

Johan Hastad, Royal Institute of Technology

pp. 158

PDF

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

PDF

Session 5

On Operators of Higher Types (Abstract)

Heribert Vollmer, Universitaet Wuerzburg

Klaus W. Wagner, Universitaet Wuerzburg

pp. 174

PDF

Time Bounded Frequency Computations (Abstract)

Maren Hinrichs, Friedrich-Schiller-Universit\"at Jena

Gerd Wechsung, Friedrich-Schiller-Universit\"at Jena

pp. 185

PDF

Circuits And Expressions With Non-Associative Gates (Abstract)

J. Berman, State Univ. of New York, Binghamton, NY, USA

A. Drisko, 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

D. Therien, State Univ. of New York, Binghamton, NY, USA

pp. 193

PDF

A Nonadaptive NC Checker for Permutation Group Intersection (Abstract)

V. Arvind, The Institute of Mathematical Sciences

J. Toran, Universitat Ulm

pp. 204

PDF

Acceptance by Transformation Monoids (with an Application to Local Self Reductions) (Abstract)

Ulrich Hertrampf, Univ. Stuttgart

pp. 213

PDF

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

PDF

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

L. Babai, Dept. of Comput. Sci., Chicago Univ., IL, USA

P.G. Kimmel, Dept. of Comput. Sci., Chicago Univ., IL, USA

pp. 239

PDF

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

PDF

Session 7

A Short Guide To Approximation Preserving Reductions (Abstract)

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

pp. 262

PDF

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

PDF

Constraint Satisfaction: The Approximability of Minimization Problems (Abstract)

Sanjeev Khanna, Bell Labs

Madhu Sudan, IBM Thomas J. Watson Research Center

Luca Trevisan, Universite de Geneve

pp. 282

PDF

A Note on the Bottleneck Counting Argument (Abstract)

Janos Simon, University of Chicago

Shi-Chun Tsai, National Chi-Nan International University

pp. 297

PDF

Finite Limits and Monotone Computations: The Lower Bounds Criterion (Abstract)

Stasys Jukna, Trier University

pp. 302

PDF

Author Index (PDF)

pp. 315