The Community for Technology Leaders
Proceedings Fifth Annual Structure in Complexity Theory Conference (1990)
Barcelona, Spain
July 8, 1990 to July 11, 1990
ISBN: 0-8186-6072-4
TABLE OF CONTENTS

On polynomial time bounded truth-table reducibility of NP sets to sparse sets (PDF)

M. Ogiwara , Tokyo Inst. of Technol., Japan
O. Watanabe , Tokyo Inst. of Technol., Japan
pp. 2

Structural properties of nondeterministic complete sets (PDF)

S. Homer , Dept. of Comput. Sci., Boston Univ., MA, USA
pp. 3-10

On sets with efficient implicit membership tests (PDF)

L.A. Hemachandra , Dept. of Comput. Sci., Rochester Univ., NY, USA
pp. 11-19

On the instance complexity of NP-hard problems (PDF)

P. Orponen , Dept. of Comput. Sci., Helsinki Univ., Finland
pp. 20-27

E-mail and the unexpected power of interaction (PDF)

L. Babai , Eotvos Univ., Budapest, Hungary
pp. 30-44

On bounded round multiprover interactive proof systems (PDF)

J. Cai , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 45-54

Privacy, additional information, and communication (PDF)

R. Bar-Yehuda , Dept. of Comput. Sci., Technion-Israel, Haifa, Israel
B. Chor , Dept. of Comput. Sci., Technion-Israel, Haifa, Israel
E. Kushilevitz , Dept. of Comput. Sci., Technion-Israel, Haifa, Israel
pp. 55-65

On the power of randomness in the decision tree model (PDF)

P. Hajnal , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 66-77

The computational complexity of universal hashing (PDF)

Y. Mansour , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 90

Lower bounds on random-self-reducibility (PDF)

J. Feigenbaum , AT&T Bell Labs., Murray Hill, NJ, USA
pp. 100-109

Non-uniform complexity classes and random languages (PDF)

M. Mundhenk , Ulm Univ., West Germany
R. Schuler , Ulm Univ., West Germany
pp. 110-119

Width-bounded reducibility and binary search over complexity classes (PDF)

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

Unambiguity of circuits (PDF)

K.-J. Lange , Inst. fuer Inf., Tech. Univ., Munchen, West Germany
pp. 130-137

A very hard log space counting class (PDF)

C. Alvarez , Dept. L.S.I., Univ. Politecnica de Catalunya, Barcelona, Spain
pp. 154-168

The Boolean hierarchy and the polynomial hierarchy: a closer connection (PDF)

R. Chang , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
pp. 169-178

On read-once vs. multiple access to randomness in logspace (PDF)

N. Nisan , Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
pp. 179-184

Bounded arithmetic and computational complexity (PDF)

P. Clote , Dept. of Comput. Sci., Boston Coll., Chestnut Hill, MA, USA
pp. 186-199

Extensions to Barrington's M-program model (PDF)

F. Bedard , Dept. d'Inf. et Recherche Oper., Montreal Univ., Que., Canada
F. Lemieux , Dept. d'Inf. et Recherche Oper., Montreal Univ., Que., Canada
P. McKenzie , Dept. d'Inf. et Recherche Oper., Montreal Univ., Que., Canada
pp. 200-209

The quantifier structure of sentences that characterize nondeterministic time complexity (PDF)

J.F. Lynch , Dept. of Math. & Comput. Sci., Clarkson Univ., Potsdam, NY, USA
pp. 210-222

Circuits, pebbling and expressibility (PDF)

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

Quantifiers and approximation (PDF)

A. Popanconesi , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
D. Ranjan , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
pp. 244

Impossibilities and possibilities of weak separation between NP and exponential time (PDF)

G. Lischke , Dept. of Math., Friedrich-Schiller Univ., Jena, East Germany
pp. 245-253

P-productivity and polynomial time approximations (PDF)

J. Wang , Dept. of Comput. Sci., Boston Univ., MA, USA
pp. 254-265

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. 268-286

A note on relativizing complexity classes with tally (PDF)

L.A. Hemachandra , Dept. of Comput. Sci., Rochester Univ., NY, USA
pp. 287-294

An oracle separating (+)P from PP/sup PH/ (PDF)

F. Green , Dept. of Math. & Comput. Sci., Clark Univ., Worcester, MA, USA
pp. 295-298

On separating complexity classes (PDF)

R.V. Book , Dept. of Math., California Univ., Santa Barbara, CA, USA
pp. 299-304

Complexity classes with advice (PDF)

J. Kobler , Ulm Univ., West Germany
T. Thierauf , Ulm Univ., West Germany
pp. 305-315
87 ms
(Ver 3.3 (11022016))