The SCEAS System
Navigation Menu

Journals in DBLP

Computational Complexity
1999, volume: 8, number: 3

  1. Markus Bläser
    Lower bounds for the multiplicative complexity of matrix multiplication. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1999, v:8, n:3, pp:203-226 [Journal]
  2. Ming-Deh A. Huang, Yiu-Chung Wong
    Solvability of systems of polynomial congruences modulo a large prime. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1999, v:8, n:3, pp:227-257 [Journal]
  3. David A. Mix Barrington, Howard Straubing
    Lower bounds for modular counting by circuits with modular gates. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1999, v:8, n:3, pp:258-272 [Journal]
  4. Maciej Liskiewicz, Rüdiger Reischuk
    On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1999, v:8, n:3, pp:273-307 [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