default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Complexity, Volume 1
Volume 1, 1991
- László Babai
, Lance Fortnow, Carsten Lund:
Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. 3-40 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-05 22:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
