The SCEAS System
Navigation Menu

Journals in DBLP

Computational Complexity
2001, volume: 10, number: 2

  1. Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Leen Torenvliet
    Two oracles that force a big crunch. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:2, pp:93-116 [Journal]
  2. Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich
    Reducing the complexity of reductions. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:2, pp:117-138 [Journal]
  3. Dima Grigoriev
    Complexity of Positivstellensatz proofs for the knapsack. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:2, pp:139-154 [Journal]
  4. Martin Sauerhoff
    On the size of randomized OBDDs and read-once branching programs for k-stable functions. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:2, pp:155-178 [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