Solving Linear Programs in Truly Matrix Multiplication TimeResearch Paper
Linear programming is a central problem of optimization and theoretical computer science. For dense programs, the fastest known algorithms are interior-point methods. Karmarkar's method runs in time, and Vaidya improved this to (Vaidya 1989). Cohen, Lee and Song reached (CLS 2021), and…