The SCEAS System
Navigation Menu

Journals in DBLP

Computational Complexity
2004, volume: 13, number: 1-2

  1. Valentine Kabanets, Russell Impagliazzo
    Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2004, v:13, n:1-2, pp:1-46 [Journal]
  2. Maria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, Toniann Pitassi
    Non-Automatizability of Bounded-Depth Frege Proofs. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2004, v:13, n:1-2, pp:47-68 [Journal]
  3. Satoru Kuroda
    Recursion Schemata for Slowly Growing Depth Circuit Classes. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2004, v:13, n:1-2, pp:69-89 [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