Volume 1, 1991
- László Babai, Lance Fortnow, Carsten Lund:
Non-Deterministic Exponential Time has Two-Prover Interactive Protocols.
3-40, (Addendum: Computational Complexity 2: 374 (1992))
- László Babai, Lance Fortnow:
Arithmetization: A New Method in Structural Complexity Theory.
41-66
- Allan Borodin, Prasoon Tiwari:
On the Decidability of Sparse Univariate Polynomial Interpolation.
67-90
- Richard Cleve:
Towards Optimal Simulations of Formulas by Bounded-Width Programs.
91-105
- Johan Håstad, Mikael Goldmann:
On the Power of Small-Depth Threshold Circuits.
113-129
- Peter Bürgisser, Marek Karpinski, Thomas Lickteig:
Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication.
131-155
- Mohammad Amin Shokrollahi:
On the Rank of Certain Finite Fields.
157-181
- Wayne Eberly:
Decomposition of Algebras Over Finite Fields and Number Fields.
183-210
- Wayne Eberly:
Decompositions of Algebras Over R and C.
211-234
- Ulrich Baum:
Existence and Efficient Construction of Fast Fourier Transforms on Supersolvable Groups.
235-256
- Michael D. Hirsch:
Lower Bounds for the Non-Linear Complexity of Algebraic Computation Trees with Integer Inputs.
257-268
- Ker-I Ko, Wen-Guey Tzeng:
Three Sigma^p_2-Complete Problems in Computational Learning Theory.
269-310
- Rafi Heiman, Avi Wigderson:
Randomized VS. Deterministic Decision Tree Complexity for Read-Once Boolean Functions.
311-329
- Pierre McKenzie, Pierre Péladeau, Denis Thérien:
NC¹: The Automata-Theoretic Viewpoint.
330-359
- Joachim von zur Gathen:
Efficient and Optimal Exponentiation in Finite Fields.
360-394
Last update Sat May 25 19:45:17 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
