Journals in DBLP

Computational Complexity
1999, volume: 8, number: 2

1. Eric Allender, Robert Beals, Mitsunori Ogihara
   The Complexity of Matrix Rank and Feasible Systems of Linear Equations. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1999, v:8, n:2, pp:99-126 [Journal]
   
2. Russell Impagliazzo, Pavel Pudlák, Jiri Sgall
   Lower Bounds for the Polynomial Calculus and the Gröbner Basis Algorithm. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1999, v:8, n:2, pp:127-144 [Journal]
   
3. Carlo Blundo, Alfredo De Santis, Giuseppe Persiano, Ugo Vaccaro
   Randomness Complexity of Private Computation. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1999, v:8, n:2, pp:145-168 [Journal]
   
4. Ashish V. Naik, Alan L. Selman
   Adaptive Versus Nonadaptive Queries to NP and p-Selective Sets. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1999, v:8, n:2, pp:169-187 [Journal]
   
5. Bruce M. Kapron
   Feasibly Continuous Type-Two Functionals. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1999, v:8, n:2, pp:188-201 [Journal]