The SCEAS System
Navigation Menu

Journals in DBLP

Computational Complexity
2008, volume: 17, number: 2


  1. Special Issue: "Conference on Computational Complexity 2007" Guest Editor's Foreword. [Citation Graph (, )][DBLP]


  2. Halfspace Matrices. [Citation Graph (, )][DBLP]


  3. Time-Space Tradeoffs for Counting NP Solutions Modulo Integers. [Citation Graph (, )][DBLP]


  4. Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time. [Citation Graph (, )][DBLP]


  5. Basis Collapse in Holographic Algorithms. [Citation Graph (, )][DBLP]


  6. Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems. [Citation Graph (, )][DBLP]


  7. Limits on the Hardness of Lattice Problems in lp Norms. [Citation Graph (, )][DBLP]

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