The Subspace Flatness Conjecture and Faster Integer Programming by Victor Reis
The Subspace Flatness Conjecture and Faster Integer Programming - Victor Reis
Victor Reis "The Subspace Flatness Conjecture and Faster Integer Programming"
TCS+ Talk: Victor Reis (University of Washington)
Daniel Dadush: Integer Programming and the Kannan-Lovasz Conjecture
On Approximating the Covering Radius and Finding Dense Lattice Subspaces
Lecture Daniel Dadush - Integer and Linear Programming Beyond the Worst-Case
Nearly Optimal Deterministic Algorithms Via M-Ellipsoids - Santosh Vempala
Tom Coates (Imperial)
Bala Krishnamoorthy (4/20/17): Linear Programming in Geometric Measure Theory
CWI Lectures on Algebraic and Geometric methods in Optimization (Complete event)
UW - MSR Machine Learning workshop 2015 - Session 5
The Condition Number of a Random Matrix: From von Neumann-Goldstine to Spielman-Teng - Van Vu
The String Theory Iceberg EXPLAINED
Higgs bundles and higher Teichmüller components (Lecture 1) by Oscar Garcia
Klee Irwin - Emergence Theory Overview - Part 3 of 6
The Narasimhan-Seshadri theorem and some of its ramifications
Emmy Noether in Erlangen and Göttingen by Ravi Rao