The SCEAS System
Navigation Menu

Journals in DBLP

Computational Complexity
1997, volume: 6, number: 4

  1. Roman Smolensky
    Well-Known Bound for the VC-Dimension Made Easy. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:4, pp:299-300 [Journal]
  2. Victor Shoup, Roman Smolensky
    Lower Bounds for Polynomial Evaluation and Interpolation Problems. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:4, pp:301-311 [Journal]
  3. Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, Prasoon Tiwari
    The Electrical Resistance of a Graph Captures its Commute and Cover Times. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:4, pp:312-340 [Journal]
  4. Uriel Feige
    Collecting Coupons on Trees, and the Cover Time of Random Walks. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:4, pp:341-356 [Journal]
  5. Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky
    A Lower Bound for Randomized Algebraic Decision Trees. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:4, pp:357-375 [Journal]
  6. Dima Grigoriev, Marek Karpinski, Roman Smolensky
    Randomization and the Computational Power of Analytic and Algebraic Decision Trees. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:4, pp:376-388 [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