Journals in DBLP
László Babai , Lance Fortnow , Carsten Lund Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. [Citation Graph (0, 0)][DBLP ] Journal ] László Babai , Lance Fortnow Arithmetization: A New Method in Structural Complexity Theory. [Citation Graph (0, 0)][DBLP ] Journal ] Allan Borodin , Prasoon Tiwari On the Decidability of Sparse Univariate Polynomial Interpolation. [Citation Graph (0, 0)][DBLP ] Journal ] Richard Cleve Towards Optimal Simulations of Formulas by Bounded-Width Programs. [Citation Graph (0, 0)][DBLP ] Journal ] Johan Håstad , Mikael Goldmann On the Power of Small-Depth Threshold Circuits. [Citation Graph (0, 0)][DBLP ] Journal ] Peter Bürgisser , Marek Karpinski , Thomas Lickteig Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication. [Citation Graph (0, 0)][DBLP ] Journal ] Mohammad Amin Shokrollahi On the Rank of Certain Finite Fields. [Citation Graph (0, 0)][DBLP ] Journal ] Wayne Eberly Decomposition of Algebras Over Finite Fields and Number Fields. [Citation Graph (0, 0)][DBLP ] Journal ] Wayne Eberly Decompositions of Algebras Over R and C. [Citation Graph (0, 0)][DBLP ] Journal ] Ulrich Baum Existence and Efficient Construction of Fast Fourier Transforms on Supersolvable Groups. [Citation Graph (0, 0)][DBLP ] Journal ] Michael D. Hirsch Lower Bounds for the Non-Linear Complexity of Algebraic Computation Trees with Integer Inputs. [Citation Graph (0, 0)][DBLP ] Journal ] Ker-I Ko , Wen-Guey Tzeng Three Sigma^p_2-Complete Problems in Computational Learning Theory. [Citation Graph (0, 0)][DBLP ] Journal ] Rafi Heiman , Avi Wigderson Randomized VS. Deterministic Decision Tree Complexity for Read-Once Boolean Functions. [Citation Graph (0, 0)][DBLP ] Journal ] Pierre McKenzie , Pierre Péladeau , Denis Thérien NC¹: The Automata-Theoretic Viewpoint. [Citation Graph (0, 0)][DBLP ] Journal ] Joachim von zur Gathen Efficient and Optimal Exponentiation in Finite Fields. [Citation Graph (0, 0)][DBLP ] Journal ] 