Sergey Samsonov
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Complexity×1Algorithms×1
Frequent co-authors
Research Timeline
2026
A lower bound for $\langle 3,2,m \rangle$ matrix multiplication
The paper proves a lower bound on the bilinear complexity of matrix multiplication and formally verifies the result in Lean 4.
Highlighted terms show continued research focus across papers