The SCEAS System
Navigation Menu

Journals in DBLP

Computational Complexity
2003, volume: 12, number: 1-2

  1. Ronen Shaltiel
    Towards proving strong direct product theorems. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2003, v:12, n:1-2, pp:1-22 [Journal]
  2. Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor Shparlinski
    Complexity of some arithmetic problems for binary polynomials. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2003, v:12, n:1-2, pp:23-47 [Journal]
  3. John Watrous
    On the complexity of simulating space-bounded quantum computations. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2003, v:12, n:1-2, pp:48-84 [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