The SCEAS System
Navigation Menu

Journals in DBLP

Computational Complexity
1997, volume: 6, number: 3

  1. Allan Borodin
    Tribute to Roman Smolensky. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:3, pp:195-198 [Journal]
  2. Roman Smolensky
    Representations of Sets of Boolean Functions by Commutative Rings. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:3, pp:199-208 [Journal]
  3. Jehoshua Bruck
    Reflections on ``Representations of Sets of Boolean Functions by Commutative Rings'' by Roman Smolensky. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:3, pp:209-212 [Journal]
  4. Roman Smolensky
    Easy Lower Bound for a Strange Computational Model. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:3, pp:213-216 [Journal]
  5. Noam Nisan, Avi Wigderson
    Lower Bounds on Arithmetic Circuits Via Partial Derivatives. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:3, pp:217-234 [Journal]
  6. Richard Beigel, Alexis Maciel
    Upper and Lower Bounds for Some Depth-3 Circuit Classes. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:3, pp:235-255 [Journal]
  7. Samuel R. Buss, Russell Impagliazzo, Jan Krajícek, Pavel Pudlák, Alexander A. Razborov, Jiri Sgall
    Proof Complexity in Algebraic Systems and Bounded Depth Frege Systems with Modular Counting. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:3, pp:256-298 [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