The Community for Technology Leaders
Structure in Complexity Theory Conference, Annual (1995)
Minneapolis, Minnesota
June 19, 1995 to June 22, 1995
ISSN: 1063-6870
ISBN: 0-8186-7052-5
TABLE OF CONTENTS

Foreword (PDF)

pp. viii

Committees (PDF)

pp. ix
Session 1: Chair: Russell Impagliazzo, University of California, San Diego

Counting quantifiers, successor relations, and logarithmic space (Abstract)

K. Etessami , Dept. of Comput. Sci., Massachusetts Univ., Amherst, MA, USA
pp. 2

Towards average-case complexity analysis of NP optimization problems (Abstract)

R. Schuler , Abteilung Theor. Inf., Ulm Univ., Germany
O. Watanabe , Abteilung Theor. Inf., Ulm Univ., Germany
pp. 12
Session 2: Chair: Richard Lipton, Princeton University

On superlinear lower bounds in complexity theory (Abstract)

K.W. Regan , State Univ. of New York, Buffalo, NY, USA
pp. 50

Fault tolerant circuits and probabilistically checkable proofs (Abstract)

A. Gal , Dept. of Comput. Sci., Chicago Univ., IL, USA
M. Szegedy , Dept. of Comput. Sci., Chicago Univ., IL, USA
pp. 65

Decision trees with AND, OR queries (Abstract)

Y. Ben-Asher , Dept. of Math. & Comput. Sci., Haifa Univ., Israel
I. Newman , Dept. of Math. & Comput. Sci., Haifa Univ., Israel
pp. 74

Semi-unbounded fan-in circuits: Boolean vs. arithmetic (Abstract)

A. Gal , Dept. of Comput. Sci., Chicago Univ., IL, USA
pp. 82
Session 3: Chair: Lance Fortnow, University of Chicago

The isomorphism conjecture holds and one-way functions exist relative to an oracle (Abstract)

J. Rogers , Dept. of Comput. Sci., Chicago Univ., IL, USA
pp. 90

Inverting the Turing jump in complexity theory (Abstract)

S.A. Fenner , Comput. Sci. Dept., Univ. of Southern Maine, Portland, ME, USA
pp. 102

The instance complexity conjecture (Abstract)

M. Kummer , Inst. fur Logik, Lomplexitat und Deduktionssystem, Karlsruhe Univ., Germany
pp. 111

Frequency computation and bounded queries (Abstract)

W. Gasarch , Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA
R. Beigel , Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA
E. Kinber , Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA
pp. 125
Session 4: Chair: Ker-I. Ko, SUNY/Stony Brook

A personal view of average-case complexity (Abstract)

R. Impagliazzo , Dept. of Comput. Sci. & Eng., California Univ., San Diego, La Jolla, CA, USA
pp. 134
Session 5: Chair: Eric Allender, Rutgers University

Resource-bounded genericity (Abstract)

K. Ambos-Spies , Math. Inst., Heidelberg Univ., Germany
pp. 162

Resource-bounded Baire category: a stronger approach (Abstract)

S.A. Fenner , Comput. Sci. Dept., Univ. of Southern Maine, Portland, ME, USA
pp. 182

A note on genericity and bi-immunity (Abstract)

J.L. Balcazar , Dept. de Llenguatges i Sistemes Inf., Univ. Politecnica de Catalunya, Barcelona, Spain
E. Mayordomo , Dept. de Llenguatges i Sistemes Inf., Univ. Politecnica de Catalunya, Barcelona, Spain
pp. 193

An excursion to the Kolmogorov random strings (Abstract)

H. Buhrman , CWI, Amsterdam, Netherlands
E. Mayordomo , CWI, Amsterdam, Netherlands
pp. 197
Session 6: Chair: Kenneth Regan, SUNY/Buffalo

Restricted information from nonadaptive queries to NP (Abstract)

T. Thierauf , Dept. of Comput. Sci., Rochester Univ., NY, USA
Yenjo Han , Dept. of Comput. Sci., Rochester Univ., NY, USA
pp. 206

On approximation algorithms for hierarchical MAX-SAT (Abstract)

S. Agarwal , Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA
A. Condon , Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA
pp. 214

A game-theoretic classification of interactive complexity classes (Abstract)

J. Feigenbaum , AT&T Bell Labs., Murray Hill, NJ, USA
D. Koller , AT&T Bell Labs., Murray Hill, NJ, USA
P. Shor , AT&T Bell Labs., Murray Hill, NJ, USA
pp. 227

Optimizing TRIEs for ordered pattern matching is /spl Pi//sub 2//sup P/-complete (Abstract)

Chih-Long Lin , Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA
pp. 238
Session 7: Chair: Klaus Ambos-Spies, Universitdit Heidelberg

On the structure of low sets [complexity classes] (Abstract)

J. Kobler , Abteilung Theor. Inf., Ulm Univ., Germany
pp. 246

On P-immunity of nondeterministic complete sets (PDF)

N. Tran , Dept. of Comput. & Inf. Sci., Pennsylvania Univ., Philadelphia, PA, USA
pp. 262

Reductions of self-reducible sets to depth-1 weighted threshold circuit classes, and sparse sets (Abstract)

M. Agrawal , Sch. of Math., SPIC Science Foundation, Madras, India
V. Arvind , Sch. of Math., SPIC Science Foundation, Madras, India
pp. 264

The Power of Local Self-Reductions (Abstract)

Richard Beigel , Yale University
pp. 277
Session 8: Chair: Johannes K?bler, Universit?t Ulm

On finding the number of graph automorphisms (Abstract)

J. Toran , Dept. of Comput. Sci., Maryland Univ., Baltimore, MD, USA
R. Chang , Dept. of Comput. Sci., Maryland Univ., Baltimore, MD, USA
W. Gasarch , Dept. of Comput. Sci., Maryland Univ., Baltimore, MD, USA
pp. 288

On the power of number-theoretic operations with respect to counting (Abstract)

U. Hertrampf , Theor. Inf., Medizinische Univ. Lubeck, Germany
K.W. Wagner , Theor. Inf., Medizinische Univ. Lubeck, Germany
H. Vollmer , Theor. Inf., Medizinische Univ. Lubeck, Germany
pp. 299

DSPACE(n)=?NSPACE(n): a degree theoretic characterization (Abstract)

M. Agrawal , Sch. of Math., SPIC Sci. Foundation, Madras, India
pp. 315

A small span theorem for P/Poly-Turing reductions (Abstract)

J.H. Lutz , Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA
pp. 324

Author Index (PDF)

pp. 331
105 ms
(Ver )