Journals in DBLP

J. Complexity
1997, volume: 13, number: 2

1. Michael Maller, Jennifer Whitehead
   Computational Complexity over thep-adic Numbers. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 1997, v:13, n:2, pp:195-207 [Journal]
   
2. Israel Gohberg, Vadim Olshevsky
   The Fast Generalized Parker-Traub Algorithm for Inversion of Vandermonde and Related Matrices. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 1997, v:13, n:2, pp:208-234 [Journal]
   
3. Ronald Cools, Andrew V. Reztsov
   Different Quality Indexes for Lattice Rules. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 1997, v:13, n:2, pp:235-258 [Journal]
   
4. Christine Gaßner
   On NP-Completeness for Linear Machines. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 1997, v:13, n:2, pp:259-271 [Journal]
   
5. Misako Yokoyama
   Computing the Topological Degree with Noisy Information. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 1997, v:13, n:2, pp:272-278 [Journal]
   
6. Valentin E. Brimkov, Stefan S. Dantchev
   Real Data--Integer Solution Problems within the Blum-Shub-Smale Computational Model. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 1997, v:13, n:2, pp:279-300 [Journal]