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

Journals in DBLP

Computational Complexity
1997, volume: 6, number: 2

  1. Uriel Feige, Carsten Lund
    On the Hardness of Computing the Permanent of Random Matrices. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:2, pp:101-132 [Journal]
  2. Rüdiger Reischuk, Christian Schindelhauer
    An Average Complexity Measure that Yields Tight Hierarchies. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:2, pp:133-173 [Journal]
  3. Nader H. Bshouty
    Simple Learning Algorithms Using Divide and Conquer. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:2, pp:174-194 [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