Proceedings: Structure in Complexity Theory Third Annual Conference (Cat. No.88CH2542-9)

The following topics are dealt with: counting; tally relativization of BP-complexity classes; relationships between communication complexity classes; downward closures; logspace self-reducibility; uniformity within NC¹; automata prediction problems; alternation; Kolmogorov complexity; complementation; retrospectives on Juris Harmanis; multipower interactive protocols; probabilistic game automata; pseudorandom sources for BPP; bounded reducibilities; complexity of ranking; truth-table reducibility; polynomial and generalized complexity cores; polynomial-query computations; and reducibilities in NP. Abstracts of individual papers can be found under the relevant classification codes in this or other issues.