The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Journals in DBLP

Computational Complexity
2000, volume: 9, number: 1

  1. Ramamohan Paturi, Michael E. Saks, Francis Zane
    Exponential lower bounds for depth three Boolean circuits. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2000, v:9, n:1, pp:1-15 [Journal]
  2. Frederic Green
    A complex-number Fourier technique for lower bounds on the Mod-m degree. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2000, v:9, n:1, pp:16-38 [Journal]
  3. Anna Bernasconi, Carsten Damm, Igor Shparlinski
    The average sensitivity of square-freeness. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2000, v:9, n:1, pp:39-51 [Journal]
  4. Catherine S. Greenhill
    The complexity of counting colourings and independent sets in sparse graphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2000, v:9, n:1, pp:52-72 [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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002