AAAAAA

   
Results: 1-7 |
Results: 7
WELL-KNOWN BOUND FOR THE VC-DIMENSION MADE EASY
Authors: SMOLENSKY R
Citation: R. Smolensky, WELL-KNOWN BOUND FOR THE VC-DIMENSION MADE EASY, Computational complexity, 6(4), 1997, pp. 299-300
LOWER BOUNDS FOR POLYNOMIAL EVALUATION AND INTERPOLATION PROBLEMS
Authors: SHOUP V SMOLENSKY R
Citation: V. Shoup et R. Smolensky, LOWER BOUNDS FOR POLYNOMIAL EVALUATION AND INTERPOLATION PROBLEMS, Computational complexity, 6(4), 1997, pp. 301-311
THE ELECTRICAL-RESISTANCE OF A GRAPH CAPTURES ITS COMMUTE AND COVER TIMES
Authors: CHANDRA AK RAGHAVAN P RUZZO WL SMOLENSKY R TIWARI P
Citation: Ak. Chandra et al., THE ELECTRICAL-RESISTANCE OF A GRAPH CAPTURES ITS COMMUTE AND COVER TIMES, Computational complexity, 6(4), 1997, pp. 312-340
A LOWER-BOUND FOR RANDOMIZED ALGEBRAIC DECISION TREES
Authors: GRIGORIEV D KARPINSKI M AUFDERHEIDE FM SMOLENSKY R
Citation: D. Grigoriev et al., A LOWER-BOUND FOR RANDOMIZED ALGEBRAIC DECISION TREES, Computational complexity, 6(4), 1997, pp. 357-375
RANDOMIZATION AND THE COMPUTATIONAL POWER OF ANALYTIC AND ALGEBRAIC DECISION TREES
Authors: GRIGORIEV D KARPINSKI M SMOLENSKY R
Citation: D. Grigoriev et al., RANDOMIZATION AND THE COMPUTATIONAL POWER OF ANALYTIC AND ALGEBRAIC DECISION TREES, Computational complexity, 6(4), 1997, pp. 376-388
REPRESENTATIONS OF SETS OF BOOLEAN FUNCTIONS BY COMMUTATIVE RINGS
Authors: SMOLENSKY R
Citation: R. Smolensky, REPRESENTATIONS OF SETS OF BOOLEAN FUNCTIONS BY COMMUTATIVE RINGS, Computational complexity, 6(3), 1997, pp. 199-208
EASY LOWER-BOUND FOR A STRANGE COMPUTATIONAL MODEL
Authors: SMOLENSKY R
Citation: R. Smolensky, EASY LOWER-BOUND FOR A STRANGE COMPUTATIONAL MODEL, Computational complexity, 6(3), 1997, pp. 213-216
Risultati: 1-7 |