The SCEAS System
Navigation Menu

Journals in DBLP

Computational Complexity
2002, volume: 11, number: 3-4

  1. Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi
    Homogenization and the polynomial calculus. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2002, v:11, n:3-4, pp:91-108 [Journal]
  2. Eli Ben-Sasson
    Hard examples for the bounded depth Frege proof system. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2002, v:11, n:3-4, pp:109-136 [Journal]
  3. Lance Fortnow, John D. Rogers
    Separability and one-way functions. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2002, v:11, n:3-4, pp:137-157 [Journal]
  4. Bruno Codenotti, Igor Shparlinski, Arne Winterhof
    On the hardness of approximating the permanent of structured matrices. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2002, v:11, n:3-4, pp:158-170 [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