Journals in DBLP

Computational Complexity
1994, volume: 4, number:

1. Noam Nisan
   RL <= SC. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1994, v:4, n:, pp:1-11 [Journal]
   
2. José Luis Montaña, Luis Miguel Pardo, Tomás Recio
   A Note on Rabin's Width of a Complete Proof. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1994, v:4, n:, pp:12-36 [Journal]
   
3. Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein, Marek Karpinski
   An Algorithm to Learn Read-Once Threshold Formulas, and Transformations Between Learning Models. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1994, v:4, n:, pp:37-61 [Journal]
   
4. Etienne Grandjean
   Invariance Properties of Rams and Linear Time. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1994, v:4, n:, pp:62-106 [Journal]
   
5. Marie-Françoise Roy, Nicolai Vorobjov
   Finding Irreducible Components of Some Real Transcendental Varieties. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1994, v:4, n:, pp:107-132 [Journal]
   
6. Erez Petrank
   The Hardness of Approximation: Gap Location. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1994, v:4, n:, pp:133-157 [Journal]
   
7. Joan Feigenbaum, Lance Fortnow, Carsten Lund, Daniel A. Spielman
   The Power of Adaptiveness and Additional Queries in Random-Self-Reductions. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1994, v:4, n:, pp:158-174 [Journal]
   
8. Stephen A. Bloch
   Function-Algebraic Characterizations of Log and Polylog Parallel Time. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1994, v:4, n:, pp:175-205 [Journal]
   
9. Alan M. Frieze, Shang-Hua Teng
   On the Complexity of Computing the Diameter of a Polytope. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1994, v:4, n:, pp:207-219 [Journal]
   
10. Anne Condon
    A Theory of Strict P-Completeness. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:220-241 [Journal]
    
11. Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
    On Closure Properties of GapP. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:242-261 [Journal]
    
12. Lane A. Hemaspaandra, Mitsunori Ogihara, Seinosuke Toda
    Space-Efficient Recognition of Sparse Self-Reducible Languages. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:262-296 [Journal]
    
13. Pierre McKenzie, Denis Thérien
    Special Issue on Circuit Complexity: Foreword. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:297-300 [Journal]
    
14. Noam Nisan, Mario Szegedy
    On the Degree of Boolean Functions as Real Polynomials. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:301-313 [Journal]
    
15. Richard Beigel
    When do Extra Majority Gates Help? Polylog(N) Majority Gates Are Equivalent to One. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:314-324 [Journal]
    
16. David A. Mix Barrington, Howard Straubing
    Complex Polynomials and Circuit Lower Bounds for Modular Counting. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:325-338 [Journal]
    
17. Richard Beigel
    Perceptrons, PP, and the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:339-349 [Journal]
    
18. Richard Beigel, Jun Tarui
    On ACC. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:350-366 [Journal]
    
19. David A. Mix Barrington, Richard Beigel, Steven Rudich
    Representing Boolean Functions as Polynomials Modulo Composite Numbers. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:367-382 [Journal]
    
20. Denis Thérien
    Circuits Constructed with Mod_q Gates Cannot Compute "And" in Sublinear Size. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:383-388 [Journal]