Journal: Computational Complexity

Volume 7, Issue 4

291 -- 324Alexander A. Razborov. Lower Bounds for the Polynomial Calculus
325 -- 345Paul Beame, Russell Impagliazzo, Toniann Pitassi. Improved Depth Lower Bounds for Small Distance Connectivity
346 -- 370Matthias Krause, Pavel Pudlák. Computing Boolean Functions by Polynomials and Threshold Circuits
371 -- 387Ian Glaister, Jeffrey Shallit. Automaticity III: Polynomial Automaticity and Context-Free Languages

Volume 7, Issue 3

193 -- 203Dima Grigoriev, Marek Karpinski, Andrew Chi-Chih Yao. An exponential lower bound on the size of algebraic decision trees for Max
205 -- 263Lavinia Egidi. A quantifier elimination for the theory of ::::p::::-adic numbers
265 -- 289Ronald V. Book, Heribert Vollmer, Klaus W. Wagner. Probabilistic Type-2 Operators and Almost -Classes

Volume 7, Issue 2

99 -- 108Gábor Tardos, David A. Mix Barrington. A Lower Bound on the Mod 6 Degree of the Or Function
109 -- 127Carsten Damm, Stasys Jukna, Jiri Sgall. Some Bounds on Multiparty Communication Complexity of Pointer Jumping
128 -- 151Miklos Santha, Sovanna Tan. Verifying the Determinant in Parallel
152 -- 162Alexander Russell, Ravi Sundaram. Symmetric Alternation Captures BPP
163 -- 173Pierluigi Crescenzi, Riccardo Silvestri. Sperner s Lemma and Robust Machines
174 -- 191Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik. On Coherence, Random-Self-Reducibility, and Self-Correction

Volume 7, Issue 1

1 -- 18Vince Grolmusz. Circuits and Multi-Party Protocols
19 -- 53Howard Aizenstein, Tibor Hegedüs, Lisa Hellerstein, Leonard Pitt. Complexity Theoretic Hardness Results for Query Learning
54 -- 97Etienne Grandjean, Frédéric Olive. Monadic Logical Definability of Nondeterministic Linear Time