The Community for Technology Leaders
1991 Proceedings of the Sixth Annual Structure in Complexity Theory Conference (1991)
Chicago, IL, USA
June 30, 1991 to July 3, 1991
ISBN: 0-8186-2255-5
TABLE OF CONTENTS

Counting classes are at least as hard as the polynomial-time hierarchy (PDF)

S. Toda , Dept. of Comput. Sci. & Inf. Math., Univ. of Electro-commun., Tokyo, Japan
M. Ogiwara , Dept. of Comput. Sci. & Inf. Math., Univ. of Electro-commun., Tokyo, Japan
pp. 2-12

A complexity theory for feasible closure properties (PDF)

M. Ogiwara , Dept. of Inf. Sci., Tokyo Inst. of Technol., Japan
pp. 16-29

Gap-definable counting classes (PDF)

S.A. Fenner , Dept. of Comput. Sci., Chicago Univ., IL, USA
L.J. Fortnow , Dept. of Comput. Sci., Chicago Univ., IL, USA
S.A. Kurtz , Dept. of Comput. Sci., Chicago Univ., IL, USA
pp. 30-42

The power of witness reduction (PDF)

S. Gupta , Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA
pp. 43-59

Bounded queries in recursion theory: a survey (PDF)

W. Gasarch , Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA
pp. 62-78

On reductions of NP sets to sparse sets (PDF)

S. Homer , Dept. of Comput. Sci., Boston Univ., MA, USA
pp. 79-88

On the computational complexity of small descriptions (PDF)

R. Gavalda , Dept. of Software, Univ. Politecnica de Catalunya, Barcelona, Spain
pp. 89-101

Complexity classes and sparse oracles (PDF)

D.P. Bovet , Dept. of Math., Rome Univ., Italy
pp. 102-108

PSPACE is provable by two provers in one round (PDF)

J.-Y. Cai , Dept., of Comput. Sci., Princeton Univ., NJ, USA
pp. 110-115

On the success probability of the two provers in one-round proof systems (PDF)

U. Feige , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 116-123

On the random-self-reducibility of complete sets (PDF)

J. Feigenbaum , AT&T Bell Labs., Murray Hill, NJ, USA
pp. 124-132

One-way functions, hard on average problems, and statistical zero-knowledge proofs (PDF)

R. Ostrovsky , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 133-138

On one query, self-reducible sets (PDF)

M. Ogiwara , Dept. of Comput. Sci. & Inf. Math., Univ. of Electro-Commun., Tokyo, Japan
pp. 139-151

Combinatorics and Kolmogorov complexity (PDF)

M. Li , Dept. of Comput. Sci., Waterloo Univ., Ont., Canada
pp. 154-163

The complexity of malign ensembles (PDF)

P.B. Miltersen , Dept. of Comput. Sci., Aaarhus Univ., Ny Munkegade, Denmark
pp. 164-171

On the Monte Carlo Boolean decision tree complexity of read-once formulae (PDF)

M. Santha , CNRS, Univ. Paris-Sud, Orsay, France
pp. 180-187

A pseudorandom oracle characterization of BPP (PDF)

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

Notions of resource-bounded category and genericity (PDF)

S.A. Fenner , Dept. of Comput. Sci., Chicago Univ., IL, USA
pp. 196-212

Relating equivalence and reducibility to sparse sets (PDF)

E. Allender , Dept. of Comput. Sci., Rutgers Univ., New Brunswick, NJ, USA
pp. 220-229

Adaptive logspace and depth-bounded reducibilities (PDF)

J.L. Balcazar , Dept. of de Llenguatges i Sistemes Inf., Univ. Politecnica de Catalunya, Barcelona, Spain
pp. 240-254

Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits (PDF)

V. Vinay , Dept. of Comput. Sci. & Autom., Indian Inst. of Sci., Bangalore, India
pp. 270-284

The perceptron strikes back (PDF)

R. Beigel , Yale Univ., New Haven, CT, USA
pp. 286-291

Monotone separation of logspace from NC/sup 1/ (PDF)

M. Grigni , Dept. of Math., MIT, Cambridge, MA, USA
M. Sipser , Dept. of Math., MIT, Cambridge, MA, USA
pp. 294-298

Superlinear lower bounds for bounded-width branching programs (PDF)

D.A.M. Barrington , COINS Dept., Massachusetts Univ., Amherst, MA, USA
pp. 305-313

Lower bounds with smaller domain size on concurrent write parallel machines (PDF)

J. Edmonds , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
pp. 322-331

DSPACE (n/sup k/)=VAR(k+1) (PDF)

N. Immerman , Dept. of Comput. & Inf. Sci., Massachusetts Univ., Amherst, MA, USA
pp. 334-340

Capturing complexity classes by fragments of second order logic (PDF)

E. Gradel , Math. Inst., Basel Univ., Switzerland
pp. 341-352

Approximation properties of NP minimization classes (PDF)

P.G. Kolaitis , Dept. of Comput. & Inf. Sci., California Univ., Santa Cruz, CA, USA
M.N. Thakur , Dept. of Comput. & Inf. Sci., California Univ., Santa Cruz, CA, USA
pp. 353-366

Approximation and small depth Frege proofs (PDF)

S. Bellantoni , Toronto Univ., Ont., Canada
T. Pitassi , Toronto Univ., Ont., Canada
A. Urquhart , Toronto Univ., Ont., Canada
pp. 367-381

Degree complexity of Boolean functions and its applications to relativized separations (PDF)

J. Tarui , Dept. of Comput. Sci., Rochester Univ., NY, USA
pp. 382-390

Errata for circuit size relative to pseudorandom oracles (PDF)

J.H. Lutz , Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA
W.J. Schmidt , Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA
pp. 392
96 ms
(Ver 3.3 (11022016))