The following pages link to Roman Smolensky (Q1377569):
Displaying 11 items.
- Representations of sets of Boolean functions by commutative rings (Q1377570) (← links)
- Easy lower bound for a strange computational model (Q1377572) (← links)
- Lower bounds for polynomial evaluation and interpolation problems (Q1386175) (← links)
- The electrical resistance of a graph captures its commute and cover times (Q1386176) (← links)
- A lower bound for randomized algebraic decision trees (Q1386178) (← links)
- Randomization and the computational power of analytic and algebraic decision trees (Q1386179) (← links)
- Well-known bound for the VC-dimension made easy (Q1386180) (← links)
- (Q2366718) (redirect page) (← links)
- On lower bounds for read-\(k\)-times branching programs (Q2366719) (← links)
- Polynomial Threshold Functions, $AC^0 $ Functions, and Spectral Norms (Q3990097) (← links)
- (Q4228517) (← links)
