A
Alexander A. Razborov
Researcher at University of Chicago
Publications - 146
Citations - 7698
Alexander A. Razborov is an academic researcher from University of Chicago. The author has contributed to research in topics: Upper and lower bounds & Proof complexity. The author has an hindex of 45, co-authored 144 publications receiving 7233 citations. Previous affiliations of Alexander A. Razborov include Toyota Technological Institute at Chicago & Toyota Technological Institute.
Papers
More filters
Journal ArticleDOI
Special Issue In Memory of Misha Alekhnovich. Foreword
Journal Article
On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution.
TL;DR: This paper significantly improves the lower bound to (Ω(m))k, which almost matches the upper bound above, and shows that the analysis of the technique in [Ben-Sasson and Nordstrom 2009] for proving time-space separations and trade-offs for k-DNF resolution is almost tight.
Journal ArticleDOI
Improved Convergence Guarantees for Shallow Neural Networks
TL;DR: This article showed that the convergence of depth 2 neural networks to a global minimum can extend well beyond the NNTK regime, by allowing both layers to be trained simultaneously and at different rates.
Journal ArticleDOI
Sergei Ivanovich Adian (on his eightieth birthday)
Lev D. Beklemishev,Viktor M Buchstaber,Igor Geront'evich Lysenok,Arkadii Anatol'evich Mal'tsev,Sergei Petrovich Novikov,Alexander A. Razborov,Aleksei L'vovich Semenov +6 more
Book ChapterDOI
Feasible Proofs and Computations: Partnership and Fusion
TL;DR: This talk is intended as a very informal and popular attempt to illustrate these fascinating connections by several related developments in the modern complexity theory.