The SCEAS System
Navigation Menu

Journals in DBLP

Computational Complexity
2007, volume: 16, number: 4


  1. Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword. [Citation Graph (, )][DBLP]


  2. Pseudorandomness and Average-Case Complexity Via Uniform Reductions. [Citation Graph (, )][DBLP]


  3. Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions. [Citation Graph (, )][DBLP]


  4. If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances. [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