The SCEAS System
Navigation Menu

Journals in DBLP

Computational Complexity
2005, volume: 14, number: 2

  1. Eric Allender
    Special issue "Conference on Computational Complexity 2004" Guest Editor's foreword. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:2, pp:89- [Journal]
  2. Venkatesan Guruswami, Daniele Micciancio, Oded Regev
    The complexity of the covering radius problem. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:2, pp:90-121 [Journal]
  3. Chris Marriott, John Watrous
    Quantum Arthur-Merlin games. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:2, pp:122-152 [Journal]
  4. Dániel Marx
    Parameterized complexity of constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:2, pp:153-183 [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