The SCEAS System
Navigation Menu

Journals in DBLP

Computational Complexity
2001, volume: 10, number: 3

  1. Søren Riis
    A complexity gap for tree resolution. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:3, pp:179-209 [Journal]
  2. Jeff Edmonds, Russell Impagliazzo, Steven Rudich, Jiri Sgall
    Communication complexity towards lower bounds on circuit depth. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:3, pp:210-246 [Journal]
  3. Chi-Jen Lu
    Derandomizing Arthur-Merlin games under uniform assumptions. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:3, pp:247-259 [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