Searching for authors named "Roman Smolensky" – sorted by Relevance.
-
Lower Bounds for Polynomial Evaluation and Interpolation Problems
- Lower Bounds for Polynomial Evaluation and Interpolation Problems Victor Shoup Roman Smolensky
- Cited by 11 (0 self) – Add To MetaCart
-
Randomization and the Computational Power of Analytic and Algebraic Decision Trees
- Marek Karpinski y Roman Smolensky z Abstract We introduce a new powerful method for proving lower
- Cited by 7 (5 self) – Add To MetaCart
-
On Lower Bounds for Read-k-Times Branching Programs
- Cited by 49 (0 self) – Add To MetaCart
-
Randomization and the Computational Power of Analytic and Algebraic Decision Trees
- Marek Karpinski y Roman Smolensky z Abstract We introduce a new powerful method for proving lower
- Add To MetaCart
-
The Bit Extraction Problem or t-Resilient Functions
- ** Johan Hastad Laboratory for Computer Science, MIT Joel Freidmann Steven Rudich *** Roman Smolensky EECS
- Cited by 120 (9 self) – Add To MetaCart
-
A Lower Bound for Randomized Algebraic Decision Trees
- Grigoriev 1 Marek Karpinski 2 Friedhelm Meyer auf der Heide 3 Roman Smolensky 4 1 Dept. of Computer
- Add To MetaCart
-
A Lower Bound for Randomized Algebraic Decision Trees
- Friedhelm Meyer auf der Heide x Roman Smolensky -- Abstract We prove the first nontrivial (and
- Add To MetaCart
-
A Lower Bound for Randomized Algebraic Decision Trees
- Friedhelm Meyer auf der Heide z Roman Smolensky x Abstract We extend the lower bounds on the depth
- Cited by 22 (12 self) – Add To MetaCart
-
THE ELECTRICAL RESISTANCE OF A GRAPH CAPTURES ITS COMMUTE AND COVER TIMES
- , Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, and Prasoon Tiwari Abstract. View an n-vertex, m
- Add To MetaCart
-
The Electrical Resistance Of A Graph Captures Its Commute And Cover Times
- , Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, and Prasoon Tiwari Abstract. View an n-vertex, m
- Cited by 89 (4 self) – Add To MetaCart

