The SCEAS System
Navigation Menu

Journals in DBLP

Computational Complexity
2008, volume: 17, number: 3


  1. On the Complexity of Succinct Zero-Sum Games. [Citation Graph (, )][DBLP]


  2. Polynomials that Sign Represent Parity and Descartes' Rule of Signs. [Citation Graph (, )][DBLP]


  3. The Strength of Multilinear Proofs. [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