Concepedia

Roman Smolensky

RS

12

Publications

2.2K

Citations

12

H-Index

1985

Active since

Affiliations

University of Toronto(Current)

IBM Research - Almaden

IBM (United States)

University of Washington

University of California, Berkeley

Roman Smolensky is an author at University of Toronto specializing in engineering, discrete mathematics, and computational complexity.

Top concepts

EngineeringDiscrete MathematicsApproximation TheoryComputational ComplexityComputer ScienceCircuit ComplexityAlgebraic ComplexityMathematical ProgrammingEducationSpectral Theory

Publications per year

1985–2002

12

Publications

12

Algebraic methods in the theory of lower bounds for Boolean circuit complexity

Roman Smolensky · 1987 · 753 citations · Full text

Circuit Complexity, Theory Of Computing, Computational Complexity Theory +15

The bit extraction problem or t-resilient functions

Benny Chor, Oded Goldreich, Johan Hasted et al. · 1985 · 359 citations

Hardware Security, Engineering, Arbitrary Integers +14

The electrical resistance of a graph captures its commute and cover times

Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo et al. · 1989 · 357 citations

Electrical Resistance, Graph Sparsity, Unit Resistors +15

The electrical resistance of a graph captures its commute and cover times

Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo et al. · Computational Complexity · 1996 · 326 citations

Electrical Resistance, Graph Theory, Cover Times +7

On lower bounds for read-k-times branching programs

Allan Borodin, Alexander Razborov, Roman Smolensky · Computational Complexity · 1993 · 129 citations

Mathematical Programming, Branch-and-bound Algorithm, Engineering +9

Rows per page

1–5 of 12