Journals in DBLP

Computational Complexity
1999, volume: 8, number: 4

1. Walter Baur, Karin Halupczok
   On lower bounds for the complexity of polynomials and their multiples. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1999, v:8, n:4, pp:309-315 [Journal]
   
2. Dima Grigoriev
   Complexity lower bounds for randomized computation trees over zero characteristic fields. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1999, v:8, n:4, pp:316-329 [Journal]
   
3. Sergei Ivanov, Michel de Rougemont
   Interactive protocols over the reals. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1999, v:8, n:4, pp:330-345 [Journal]
   
4. Hajime Ishihara
   Function algebraic characterizations of the polytime functions. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1999, v:8, n:4, pp:346-356 [Journal]
   
5. Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener
   On P versus NP cap co-NP for decision trees and read-once branching programs. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1999, v:8, n:4, pp:357-370 [Journal]
   
6. Martin Dietzfelbinger, Martin Hühne
   Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1999, v:8, n:4, pp:371-392 [Journal]