The SCEAS System
Navigation Menu

Journals in DBLP

Computational Complexity
2001, volume: 10, number: 4

  1. Maria Luisa Bonet, Nicola Galesi
    Optimality of size-width tradeoffs for resolution. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:4, pp:261-276 [Journal]
  2. Anna Gál
    A characterization of span program size and improved lower bounds for monotone span programs. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:4, pp:277-296 [Journal]
  3. Matthias Krause, Stefan Lucks
    Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:4, pp:297-313 [Journal]
  4. Ilan Kremer, Noam Nisan, Dana Ron
    Errata for: "On randomized one-round communication complexity". [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:4, pp:314-315 [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