The SCEAS System
Navigation Menu

Journals in DBLP

Computational Complexity
1998, volume: 7, number: 3

  1. Dima Grigoriev, Marek Karpinski, Andrew Chi-Chih Yao
    An exponential lower bound on the size of algebraic decision trees for Max. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:3, pp:193-203 [Journal]
  2. Lavinia Egidi
    A quantifier elimination for the theory of p-adic numbers. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:3, pp:205-263 [Journal]
  3. Ronald V. Book, Heribert Vollmer, Klaus W. Wagner
    Probabilistic Type-2 Operators and "Almost"-Classes. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:3, pp:265-289 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002