The SCEAS System
Navigation Menu

Journals in DBLP

Computational Complexity
2009, volume: 18, number: 1


  1. Extractors And Rank Extractors For Polynomial Sources. [Citation Graph (, )][DBLP]


  2. The Black-Box Query Complexity of Polynomial Summation. [Citation Graph (, )][DBLP]


  3. On Defining Integers And Proving Arithmetic Circuit Lower Bounds. [Citation Graph (, )][DBLP]


  4. Robust Algorithms For Generalized Pham Systems. [Citation Graph (, )][DBLP]


  5. Nullstellensätze for Zero-Dimensional Gröbner Bases. [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