Roman Smolensky

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
scientific article; zbMATH DE number 1256781 (Why is no real title available?)	1999-10-04	Paper
The electrical resistance of a graph captures its commute and cover times Computational Complexity	1999-01-19	Paper
Lower bounds for polynomial evaluation and interpolation problems Computational Complexity	1998-09-20	Paper
Well-known bound for the VC-dimension made easy Computational Complexity	1998-08-10	Paper
Representations of sets of Boolean functions by commutative rings Computational Complexity	1998-06-09	Paper
Easy lower bound for a strange computational model Computational Complexity	1998-06-09	Paper
A lower bound for randomized algebraic decision trees Computational Complexity	1998-05-13	Paper
Randomization and the computational power of analytic and algebraic decision trees Computational Complexity	1998-05-13	Paper
On lower bounds for read-\(k\)-times branching programs Computational Complexity	1993-08-30	Paper
Polynomial Threshold Functions, AC^0 Functions, and Spectral Norms SIAM Journal on Computing	1992-06-28	Paper

Research outcomes over time

This page was built for person: Roman Smolensky