Solving Linear Programs in the Current Matrix Multiplication Time
From MaRDI portal
Publication:5056400
DOI10.1145/3424305zbMath1499.90123OpenAlexW3118621910WikidataQ114071216 ScholiaQ114071216MaRDI QIDQ5056400
Michael B. Cohen, Zhao Song, Yin Tat Lee
Publication date: 8 December 2022
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3424305
Related Items (8)
Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem ⋮ Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation ⋮ Linear Programs with Conjunctive Database Queries ⋮ Economic lot sizing problem with tank scheduling ⋮ The octatope abstract domain for verification of neural networks ⋮ Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation ⋮ Representation recovery via \(L_1\)-norm minimization with corrupted data ⋮ Unnamed Item
This page was built for publication: Solving Linear Programs in the Current Matrix Multiplication Time
