A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. https://doi.org/10.1145/3357713.3384326
Chicago Style (17th ed.) Citation"A Scaling-invariant Algorithm for Linear Programming Whose Running Time Depends Only on the Constraint Matrix." Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing . https://doi.org/10.1145/3357713.3384326.
MLA (9th ed.) Citation"A Scaling-invariant Algorithm for Linear Programming Whose Running Time Depends Only on the Constraint Matrix." Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, , https://doi.org/10.1145/3357713.3384326.
Warning: These citations may not always be 100% accurate.