Journals in DBLP

J. Complexity
1991, volume: 7, number: 2

1. A. S. Nemirovsky
   On optimality of Krylov's information when solving linear operator equations. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 1991, v:7, n:2, pp:121-130 [Journal]
   
2. Stanislaw J. Szarek
   Condition numbers of random matrices. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 1991, v:7, n:2, pp:131-149 [Journal]
   
3. Arthur G. Werschulz
   Optimal residual algorithms for linear operator equations. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 1991, v:7, n:2, pp:150-173 [Journal]
   
4. Jerzy W. Jaromczyk, Grzegorz Swiatek
   A role of lower semicontinuous functions in the combinatorial complexity of geometric problems. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 1991, v:7, n:2, pp:174-183 [Journal]
   
5. Jörg-Detlef Kern
   The parallel complexity of function approximation. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 1991, v:7, n:2, pp:184-199 [Journal]
   
6. Edith Cohen, Michael Tarsi
   NP-Completeness of graph decomposition problems. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 1991, v:7, n:2, pp:200-212 [Journal]
   
7. Mark A. Kon, Roberto Tempo
   Linearity of algorithms and a result of Ando. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 1991, v:7, n:2, pp:213-217 [Journal]