Journals in DBLP

Computational Complexity
1992, volume: 2, number:

1. Richard Beigel, Joan Feigenbaum
   On Being Incoherent Without Being Very Hard. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1992, v:2, n:, pp:1-17 [Journal]
   
2. Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen
   Polynomial-Time Compression. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1992, v:2, n:, pp:18-39 [Journal]
   
3. James F. Lynch
   The Quantifier Structure of Sentences That Characterize Nondeterministic Time Complexity. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1992, v:2, n:, pp:40-66 [Journal]
   
4. Mohammad Amin Shokrollahi
   Efficient Randomized Generation of Optimal Algorithms for Multiplication in Certain Finite Fields. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1992, v:2, n:, pp:67-96 [Journal]
   
5. Stephen Bellantoni, Stephen A. Cook
   A New Recursion-Theoretic Characterization of the Polytime Functions. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1992, v:2, n:, pp:97-110 [Journal]
   
6. Matthijs J. Coster, Antoine Joux, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr, Jacques Stern
   Improved Low-Density Subset Sum Algorithms. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1992, v:2, n:, pp:111-128 [Journal]
   
7. Igor Shparlinski
   A Deterministic Test for Permutation Polynomials. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1992, v:2, n:, pp:129-132 [Journal]
   
8. D. Yu. Grigoryev, Nicolai Vorobjov
   Counting Connected Components of a Semialgebraic Set in Subexponential Time. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1992, v:2, n:, pp:133-186 [Journal]
   
9. Joachim von zur Gathen, Victor Shoup
   Computing Frobenius Maps and Factoring Polynomials. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1992, v:2, n:, pp:187-224 [Journal]
   
10. Lajos Rónyai
    Algorithmic Properties of Maximal Orders in Simple Algebras over Q. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:225-243 [Journal]
    
11. Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari
    Fast Exponentiation Using the Truncation Operation. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:244-255 [Journal]
    
12. Katia S. Guimarães, William I. Gasarch, James M. Purtilo
    Selection Problems via M-Ary Queries. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:256-276 [Journal]
    
13. Mikael Goldmann, Johan Håstad, Alexander A. Razborov
    Majority Gates VS. General Weighted Threshold Gates. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:277-300 [Journal]
    
14. Johannes Köbler, Uwe Schöning, Jacobo Torán
    Graph Isomorphism is Low for PP. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:301-330 [Journal]
    
15. Franz Aurenhammer, Johann Hagauer, Wilfried Imrich
    Cartesian Graph Factorization at Logarithmic Cost per Edge. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:331-349 [Journal]
    
16. Omer Berkman, Yossi Matias, Uzi Vishkin
    Randomized Range-Maxima in Nearly-Constant Parallel Time. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:350-373 [Journal]
    
17. László Babai, Lance Fortnow, Carsten Lund
    Addendum to Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:374- [Journal]