Abstract is missing.
- Relativized polynomial time hierarchies having exactly K levelsKer-I Ko. [doi]
- The power of countingUwe Schöning. 2-9 [doi]
- On tally relativizations of BP-complexity classesShouwen Tang, Osamu Watanabe. 10-18 [doi]
- Relations between communication complexity classesBernd Halstenberg, Rüdiger Reischuk. 19-28 [doi]
- Decision trees and downward closuresRussell Impagliazzo, Moni Naor. 29-38 [doi]
- Logspace self-reducibilityJosé L. Balcázar. 40-46 [doi]
- 1David A. Mix Barrington, Neil Immerman, Howard Straubing. 47-59 [doi]
- Reductions among prediction problems: on the difficulty of predicting automataLeonard Pitt, Manfred K. Warmuth. 60-69 [doi]
- Trading reversals for alternationOscar H. Ibarra, Tao Jiang. 70-77 [doi]
- Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87Ming Li, Paul M. B. Vitányi. 80-101 [doi]
- Kolmogorov complexity and degrees of tally setsEric Allender, Osamu Watanabe. 102-111 [doi]
- Nondeterministic space is closed under complementationNeil Immerman. 112-115 [doi]
- Two applications of complementation via inductive countingAllan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa. 116-125 [doi]
- Juris Hartmanis: the beginnings of computational complexityRichard Edwin Stearns. 128-134 [doi]
- Juris Hartmanis: building a department-building a disciplineAllan Borodin. 135-137 [doi]
- Juris Hartmanis: fundamental contributions to isomorphism problemsPaul Young. 138-154 [doi]
- On the power of multi-power interactive protocolsLance Fortnow, John Rompel, Michael Sipser. 156-161 [doi]
- Space bounded probabilistic game automataAnne Condon. 162-174 [doi]
- Pseudorandom sources for BPPJack H. Lutz. 175-180 [doi]
- Distinguishing bounded reducibilities by sparse setsKer-I Ko. 181-191 [doi]
- Enumerative counting is hardJin-yi Cai, Lane A. Hemachandra. 194-203 [doi]
- The complexity of rankingDung T. Huynh. 204-212 [doi]
- An oracle characterization of the counting hierarchyJacobo Torán. 213-223 [doi]
- On truth-table reducibility to SAT and the difference hierarchy over NPSamuel R. Buss, Louise Hay. 224-233 [doi]
- On polynomial and generalized complexity coresRonald V. Book, Ding-Zhu Du, David A. Russo. 236-250 [doi]
- On the theory of the PTIME degrees of the recursive setsJuichi Shinoda, Theodore A. Slaman. 252-257 [doi]
- Bounded query computationsKlaus W. Wagner. 260-277 [doi]
- The polynomial time hierarchy collapses if the Boolean hierarchy collapsesJim Kadin. 278-292 [doi]
- Cook is faster than Karp: a study of reducibilities in NPLuc Longpré, Paul Young. 293-302 [doi]