Jan van den Brand, Yin Tat Lee, Aaron Sidford, Zhao Song. Solving tall dense linear programs in nearly linear time. In Konstantin Makarychev, Yury Makarychev, Madhur Tulsiani, Gautam Kamath 0001, Julia Chuzhoy, editors, Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020. pages 775-788, ACM, 2020. [doi]
@inproceedings{BrandLSS20,
title = {Solving tall dense linear programs in nearly linear time},
author = {Jan van den Brand and Yin Tat Lee and Aaron Sidford and Zhao Song},
year = {2020},
doi = {10.1145/3357713.3384309},
url = {https://doi.org/10.1145/3357713.3384309},
researchr = {https://researchr.org/publication/BrandLSS20},
cites = {0},
citedby = {0},
pages = {775-788},
booktitle = {Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020},
editor = {Konstantin Makarychev and Yury Makarychev and Madhur Tulsiani and Gautam Kamath 0001 and Julia Chuzhoy},
publisher = {ACM},
isbn = {978-1-4503-6979-4},
}