The SCEAS System
| |||||||

## Search the dblp DataBase
Roman Smolensky:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Allan Borodin, Alexander A. Razborov, Roman Smolensky
**On Lower Bounds for Read-K-Times Branching Programs.**[Citation Graph (1, 0)][DBLP] Computational Complexity, 1993, v:3, n:, pp:1-18 [Journal] - Jehoshua Bruck, Roman Smolensky
**Polynomial Threshold Functions, AC^0 Functions and Spectral Norms (Extended Abstract)**[Citation Graph (0, 0)][DBLP] FOCS, 1990, pp:632-641 [Conf] - Benny Chor, Oded Goldreich, Johan Håstad, Joel Friedman, Steven Rudich, Roman Smolensky
**The Bit Extraction Problem of t-Resilient Functions (Preliminary Version)**[Citation Graph (0, 0)][DBLP] FOCS, 1985, pp:396-407 [Conf] - Victor Shoup, Roman Smolensky
**Lower Bounds for Polynomial Evaluation and Interpolation Problems**[Citation Graph (0, 0)][DBLP] FOCS, 1991, pp:378-383 [Conf] - Roman Smolensky
**On Interpolation by Analytic Functions with Special Properties and Some Weak Lower Bounds on the Size of Circuits with Symmetric Gates**[Citation Graph (0, 0)][DBLP] FOCS, 1990, pp:628-631 [Conf] - Roman Smolensky
**On Representations by Low-Degree Polynomials**[Citation Graph (0, 0)][DBLP] FOCS, 1993, pp:130-138 [Conf] - Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, Prasoon Tiwari
**The Electrical Resistance of a Graph Captures its Commute and Cover Times (Detailed Abstract)**[Citation Graph (0, 0)][DBLP] STOC, 1989, pp:574-586 [Conf] - Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky
**A Lower Bound for Randomized Algebraic Decision Trees.**[Citation Graph (0, 0)][DBLP] STOC, 1996, pp:612-619 [Conf] - Roman Smolensky
**Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity**[Citation Graph (0, 0)][DBLP] STOC, 1987, pp:77-82 [Conf] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky
**A Lower Bound for Randomized Algebraic Decision Trees**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:63, pp:- [Journal] - Jehoshua Bruck, Roman Smolensky
**Polynomial Threshold Functions, AC^0 Functions, and Spectral Norms.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1992, v:21, n:1, pp:33-42 [Journal]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |