{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T23:28:33Z","timestamp":1783985313762,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":83,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"CCF-1844887"},{"name":"NSF CAREER award"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451058","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"823-832","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["A faster algorithm for solving general LPs"],"prefix":"10.1145","author":[{"given":"Shunhua","family":"Jiang","sequence":"first","affiliation":[{"name":"Columbia University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhao","family":"Song","sequence":"additional","affiliation":[{"name":"Institute for Advanced Study at Princeton, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Omri","family":"Weinstein","sequence":"additional","affiliation":[{"name":"Columbia University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hengjie","family":"Zhang","sequence":"additional","affiliation":[{"name":"Columbia University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267816"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.87"},{"key":"e_1_3_2_1_3_1","unstructured":"Josh Alman. 2019. Inequalties for matrix multiplication exponent. In Personal communication."},{"key":"e_1_3_2_1_4_1","unstructured":"Josh Alman. 2019. Limits on the universal method for matrix multiplication. In CCC. https:\/\/arxiv.org\/pdf\/1812.08731.pdf."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Josh Alman and Virginia Vassilevska Williams. 2021. A Refined Laser Method and Faster Matrix Multiplication. In SODA. https:\/\/arxiv.org\/pdf\/2010.05846.pdf.","DOI":"10.1137\/1.9781611976465.32"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746554"},{"key":"e_1_3_2_1_8_1","volume-title":"47th annual IEEE symposium on foundations of computer science (FOCS'06)","author":"Andoni Alexandr","unstructured":"Alexandr Andoni and Piotr Indyk. 2006. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In 47th annual IEEE symposium on foundations of computer science (FOCS'06). IEEE, 459\u2013468."},{"key":"e_1_3_2_1_9_1","volume-title":"International Conference on Machine Learning (ICML). 224\u2013233","author":"Andoni Alexandr","year":"2018","unstructured":"Alexandr Andoni, Chengyu Lin, Ying Sheng, Peilin Zhong, and Ruiqi Zhong. 2018. Subspace embedding and linear regression with Orlicz norm. In International Conference on Machine Learning (ICML). 224\u2013233."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.16"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976496.1"},{"key":"e_1_3_2_1_13_1","volume-title":"Yang P Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, and Di Wang.","author":"van den Brand Jan","year":"2021","unstructured":"Jan van den Brand, Yin Tat Lee, Yang P Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, and Di Wang. 2021. Minimum Cost Flows, MDPs, and L1-Regression in Nearly Linear Time for Dense Instances. In STOC."},{"key":"e_1_3_2_1_14_1","volume-title":"Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, and Di Wang.","author":"van den Brand Jan","year":"2020","unstructured":"Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, and Di Wang. 2020. Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs. In FOCS."},{"key":"e_1_3_2_1_15_1","volume-title":"Aaron Sidford, and Zhao Song.","author":"van den Brand Jan","year":"2020","unstructured":"Jan van den Brand, Yin Tat Lee, Aaron Sidford, and Zhao Song. 2020. Solving Tall Dense Linear Programs in Nearly Linear Time. In STOC. https:\/\/arxiv.org\/pdf\/2002.02304.pdf."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00036"},{"key":"e_1_3_2_1_17_1","volume-title":"The 12th Innovations in Theoretical Computer Science Conference (ITCS).","author":"van den Brand Jan","year":"2021","unstructured":"Jan van den Brand, Binghui Peng, Zhao Song, and Omri Weinstein. 2021. Training (overparametrized) neural networks in near-linear time. In The 12th Innovations in Theoretical Computer Science Conference (ITCS)."},{"key":"e_1_3_2_1_18_1","volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Charikar Moses","unstructured":"Moses Charikar, Kevin Chen, and Martin Farach-Colton. 2002. Finding frequent items in data streams. In International Colloquium on Automata, Languages, and Programming. Springer, 693\u2013703."},{"key":"e_1_3_2_1_19_1","volume-title":"Zhao Song Tri Dao, Anshumali Shrivastava, and Christopher Re.","author":"Chen Beidi","year":"2021","unstructured":"Beidi Chen, Zichang Liu, Binghui Peng, Zhaozhuo Xu, Jonathan Lingjie Li, Zhao Song Tri Dao, Anshumali Shrivastava, and Christopher Re. 2021. MONGOOSE: A Learnable LSH Framework for Efficient Neural Network Training. In ICLR (Oral presentation). https:\/\/openreview.net\/forum?id=wWK7yXkULyh."},{"key":"e_1_3_2_1_20_1","volume-title":"Vladimir Lysikov, and Jeroen Zuiddam.","author":"Christandl Matthias","year":"2020","unstructured":"Matthias Christandl, Fran\u00e7ois Le Gall, Vladimir Lysikov, and Jeroen Zuiddam. 2020. Barriers for fast rectangular matrix multiplication. In arXiv preprint. https:\/\/arxiv.org\/pdf\/2003.03019.pdf."},{"key":"e_1_3_2_1_21_1","unstructured":"Matthias Christandl P\u00e9ter Vrana and Jeroen Zuiddam. 2019. Barriers for fast matrix multiplication from irreversibility. In CCC. https:\/\/arxiv.org\/pdf\/1812.06952.pdf."},{"key":"e_1_3_2_1_22_1","volume-title":"Symposium on Theory of Computing Conference (STOC). https:\/\/arxiv.org\/pdf\/1207","author":"Kenneth","unstructured":"Kenneth L. Clarkson and David P. Woodruff. 2013. Low rank approximation and regression in input sparsity time. In Symposium on Theory of Computing Conference (STOC). https:\/\/arxiv.org\/pdf\/1207.6365, 81\u201390."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.27"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722192"},{"key":"e_1_3_2_1_25_1","volume-title":"1st Symposium on Simplicity in Algorithms (SOSA). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.","author":"Cohen Michael B","year":"2018","unstructured":"Michael B Cohen, TS Jayram, and Jelani Nelson. 2018. Simple analyses of the sparse Johnson-Lindenstrauss transform. In 1st Symposium on Simplicity in Algorithms (SOSA). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897647"},{"key":"e_1_3_2_1_27_1","volume-title":"Yin Tat Lee, and Zhao Song","author":"Cohen Michael B","year":"2019","unstructured":"Michael B Cohen, Yin Tat Lee, and Zhao Song. 2019. Solving Linear Programs in the Current Matrix Multiplication Time. In STOC. https:\/\/arxiv.org\/pdf\/1810.07896."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.88"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.39"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374441"},{"key":"e_1_3_2_1_31_1","volume-title":"Maximization of a linear function of variables subject to linear inequalities. Activity analysis of production and allocation 13","author":"Dantzig George B","year":"1947","unstructured":"George B Dantzig. 1947. Maximization of a linear function of variables subject to linear inequalities. Activity analysis of production and allocation 13 (1947), 339\u2013347."},{"key":"e_1_3_2_1_32_1","unstructured":"Huaian Diao Zhao Song David P. Woodruff and Xin Yang. 2019. Total Least Squares Regression in Input Sparsity Time. In NeurIPS. 2478\u20132489."},{"key":"e_1_3_2_1_33_1","volume-title":"Yin Tat Lee, and Guanghao Ye","author":"Dong Sally","year":"2021","unstructured":"Sally Dong, Yin Tat Lee, and Guanghao Ye. 2021. A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path. In STOC. arXiv preprint arXiv:2011.05365."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175337"},{"key":"e_1_3_2_1_35_1","volume-title":"Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao. arXiv preprint arXiv:2101.07233","author":"Gao Yu","year":"2021","unstructured":"Yu Gao, Yang P Liu, and Richard Peng. 2021. Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao. arXiv preprint arXiv:2101.07233 (2021)."},{"key":"e_1_3_2_1_36_1","first-page":"518","article-title":"Similarity search in high dimensions via hashing","volume":"99","author":"Gionis Aristides","year":"1999","unstructured":"Aristides Gionis, Piotr Indyk, Rajeev Motwani, et al\\mbox. 1999. Similarity search in high dimensions via hashing. In Vldb, Vol. 99. 518\u2013529.","journal-title":"Vldb"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746609"},{"key":"e_1_3_2_1_38_1","volume-title":"Solving Tall Dense SDPs in the Current Matrix Multiplication Time. arXiv preprint arXiv:2101.08208","author":"Huang Baihe","year":"2021","unstructured":"Baihe Huang, Shunhua Jiang, Zhao Song, and Runzhou Tao. 2021. Solving Tall Dense SDPs in the Current Matrix Multiplication Time. arXiv preprint arXiv:2101.08208 (2021)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_40_1","volume-title":"Minimizing Convex Functions with Integral Minimizers. In ACM-SIAM Symposium on Discrete Algorithms (SODA). https:\/\/arxiv.org\/pdf\/2007","author":"Jiang Haotian","year":"2021","unstructured":"Haotian Jiang. 2021. Minimizing Convex Functions with Integral Minimizers. In ACM-SIAM Symposium on Discrete Algorithms (SODA). https:\/\/arxiv.org\/pdf\/2007.01445."},{"key":"e_1_3_2_1_41_1","volume-title":"Swati Padmanabhan, and Zhao Song.","author":"Jiang Haotian","year":"2020","unstructured":"Haotian Jiang, Tarun Kathuria, Yin Tat Lee, Swati Padmanabhan, and Zhao Song. 2020. A faster interior point method for semidefinite programming. In FOCS. https:\/\/arxiv.org\/abs\/2009.10217."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384284"},{"key":"e_1_3_2_1_43_1","volume-title":"Faster dynamic matrix inverse for faster lps. arXiv preprint arXiv:2004.07470","author":"Jiang Shunhua","year":"2020","unstructured":"Shunhua Jiang, Zhao Song, Omri Weinstein, and Hengjie Zhang. 2020. Faster dynamic matrix inverse for faster lps. arXiv preprint arXiv:2004.07470 (2020)."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2559902"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808695"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(80)90061-0"},{"key":"e_1_3_2_1_47_1","first-page":"159","article-title":"How good is the simplex algorithm","volume":"3","author":"Klee Victor","year":"1972","unstructured":"Victor Klee and George J Minty. 1972. How good is the simplex algorithm. Inequalities 3, 3 (1972), 159\u2013175.","journal-title":"Inequalities"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"e_1_3_2_1_49_1","unstructured":"Jason D Lee Ruoqi Shen Zhao Song Mengdi Wang and Zheng Yu. 2020. Generalized Leverage Score Sampling for Neural Networks. In NeurIPS."},{"key":"e_1_3_2_1_51_1","volume-title":"55th Annual IEEE Symposium on Foundations of Computer Science (FOCS). https:\/\/arxiv.org\/pdf\/1312","author":"Lee Yin Tat","year":"2014","unstructured":"Yin Tat Lee and Aaron Sidford. 2014. Path finding methods for linear programming: Solving linear programs in $O( \\sqrtrank )$ iterations and faster algorithms for maximum flow. In 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS). https:\/\/arxiv.org\/pdf\/1312.6677.pdf, https:\/\/arxiv.org\/pdf\/1312.6713.pdf, 424\u2013433."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.23"},{"key":"e_1_3_2_1_53_1","unstructured":"Yin Tat Lee Zhao Song and Qiuyi Zhang. 2019. Solving Empirical Risk Minimization in the Current Matrix Multiplication Time. In COLT. https:\/\/arxiv.org\/pdf\/1905.04447."},{"key":"e_1_3_2_1_54_1","volume-title":"Breaking the $ n $-Pass Barrier: A Streaming Algorithm for Maximum Weight Bipartite Matching. arXiv preprint arXiv:2009.06106","author":"Liu S Cliff","year":"2020","unstructured":"S Cliff Liu, Zhao Song, and Hengjie Zhang. 2020. Breaking the $ n $-Pass Barrier: A Streaming Algorithm for Maximum Weight Bipartite Matching. arXiv preprint arXiv:2009.06106 (2020)."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Yang P Liu and Aaron Sidford. 2020. Faster Divergence Maximization for Faster Maximum Flow. In FOCS.","DOI":"10.1145\/3357713.3384247"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Yang P Liu and Aaron Sidford. 2020. Faster Energy Maximization for Faster Maximum Flow. In STOC.","DOI":"10.1145\/3357713.3384247"},{"key":"e_1_3_2_1_57_1","unstructured":"Yichao Lu Paramveer Dhillon Dean P Foster and Lyle Ungar. 2013. Faster ridge regression via the subsampled randomized hadamard transform. In Advances in neural information processing systems. 369\u2013377."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.35"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.70"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.21"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"crossref","unstructured":"Richard Peng and Santosh Vempala. 2021. Solving Sparse Linear Systems Faster than Matrix Multiplication. (2021).","DOI":"10.1137\/1.9781611976465.31"},{"key":"e_1_3_2_1_62_1","volume-title":"Woodruff","author":"Price Eric","year":"2017","unstructured":"Eric Price, Zhao Song, and David P. Woodruff. 2017. Fast regression with an $\\ell_\\infty$ guarantee. In International Colloquium on Automata, Languages, and Programming (ICALP). https:\/\/arxiv.org\/pdf\/1705.10723.pdf."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.25"},{"key":"e_1_3_2_1_64_1","volume-title":"Cut-off method with space extension in convex programming problems. Cybernetics and systems analysis 13, 1","author":"Shor Naum Z","year":"1977","unstructured":"Naum Z Shor. 1977. Cut-off method with space extension in convex programming problems. Cybernetics and systems analysis 13, 1 (1977), 94\u201396."},{"key":"e_1_3_2_1_65_1","volume-title":"Breaking the Linear Iteration Cost Barrier using Projected Approximate Max-IP Data Structure. manuscript","author":"Shrivastava Anshumali","year":"2021","unstructured":"Anshumali Shrivastava, Zhao Song, and Zhaozhuo Xu. 2021. Breaking the Linear Iteration Cost Barrier using Projected Approximate Max-IP Data Structure. manuscript (2021)."},{"key":"e_1_3_2_1_66_1","volume-title":"Sublinear Least-Squares Value Iteration. manuscript","author":"Shrivastava Anshumali","year":"2021","unstructured":"Anshumali Shrivastava, Zhao Song, and Zhaozhuo Xu. 2021. Sublinear Least-Squares Value Iteration. manuscript (2021)."},{"key":"e_1_3_2_1_68_1","volume-title":"Mathematical problems for the next century. The mathematical intelligencer 20, 2","author":"Smale Steve","year":"1998","unstructured":"Steve Smale. 1998. Mathematical problems for the next century. The mathematical intelligencer 20, 2 (1998), 7\u201315."},{"key":"e_1_3_2_1_70_1","unstructured":"Zhao Song Ruosong Wang Lin F Yang Hongyang Zhang and Peilin Zhong. 2019. Efficient Symmetric Norm Regression via Linear Sketching. In Advances in Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_3_2_1_71_1","first-page":"793","article-title":"Sublinear time orthogonal tensor decomposition","volume":"29","author":"Song Zhao","year":"2016","unstructured":"Zhao Song, David Woodruff, and Huan Zhang. 2016. Sublinear time orthogonal tensor decomposition. Advances in Neural Information Processing Systems (NIPS) 29 (2016), 793\u2013801.","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055431"},{"key":"e_1_3_2_1_73_1","unstructured":"Zhao Song David P Woodruff and Peilin Zhong. 2019. Average Case Column Subset Selection for Entrywise l1-Norm Loss. In Advances in Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_3_2_1_74_1","volume-title":"Relative Error Tensor Low Rank Approximation. In ACM-SIAM Symposium on Discrete Algorithms (SODA). https:\/\/arxiv.org\/pdf\/1704","author":"Song Zhao","year":"2019","unstructured":"Zhao Song, David P Woodruff, and Peilin Zhong. 2019. Relative Error Tensor Low Rank Approximation. In ACM-SIAM Symposium on Discrete Algorithms (SODA). https:\/\/arxiv.org\/pdf\/1704.08246."},{"key":"e_1_3_2_1_75_1","unstructured":"Zhao Song David P Woodruff and Peilin Zhong. 2019. Towards a Zero-One Law for Column Subset Selection. In Advances in Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_3_2_1_76_1","volume-title":"Does preprocessing help training over-parameterized neural networks? manuscript","author":"Song Zhao","year":"2021","unstructured":"Zhao Song, Shuo Yang, and Ruizhe Zhang. 2021. Does preprocessing help training over-parameterized neural networks? manuscript (2021)."},{"key":"e_1_3_2_1_77_1","unstructured":"Zhao Song and Zheng Yu. 2020. Oblivious Sketching-based Central Path Method for Solving Linear Programming Problems. In manuscript. https:\/\/openreview.net\/forum?id=fGiKxvF-eub."},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03025891"},{"key":"e_1_3_2_1_79_1","volume-title":"Gaussian elimination is not optimal. Numerische mathematik 13, 4","author":"Strassen Volker","year":"1969","unstructured":"Volker Strassen. 1969. Gaussian elimination is not optimal. Numerische mathematik 13, 4 (1969), 354\u2013356."},{"key":"e_1_3_2_1_80_1","volume-title":"28th Annual IEEE Symposium on Foundations of Computer Science (FOCS).","author":"Vaidya Pravin M","year":"1987","unstructured":"Pravin M Vaidya. 1987. An algorithm for linear programming which requires $O (((m+ n) n^2+(m+ n)^1.5 n) L)$ arithmetic operations. In 28th Annual IEEE Symposium on Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63499"},{"key":"e_1_3_2_1_82_1","unstructured":"Santosh Vempala. 2020. General linear system. In Personal communication."},{"key":"e_1_3_2_1_83_1","volume-title":"Alexander J. Smola, and Anima Anandkumar.","author":"Wang Yining","year":"2015","unstructured":"Yining Wang, Hsiao-Yu Fish Tung, Alexander J. Smola, and Anima Anandkumar. 2015. Fast and Guaranteed Tensor Decomposition via Sketching. In NIPS. 991\u2013999."},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"},{"key":"e_1_3_2_1_85_1","volume-title":"Fast Algorithm for Solving Structured Convex Programs","author":"Guanghao Ye.","year":"2020","unstructured":"Guanghao Ye. 2020. Fast Algorithm for Solving Structured Convex Programs. The University of Washington, Undergraduate Thesis (2020)."},{"key":"e_1_3_2_1_86_1","volume-title":"Evaluation of the information complexity of mathematical programming problems. Ekonomika i Matematicheskie Metody 12","author":"Yudin David B","year":"1976","unstructured":"David B Yudin and Arkadi S Nemirovski. 1976. Evaluation of the information complexity of mathematical programming problems. Ekonomika i Matematicheskie Metody 12 (1976), 128\u2013142."},{"key":"e_1_3_2_1_87_1","unstructured":"Jeroen Zuiddam. 2019. Inequalties for matrix multiplication exponent. In Personal communication."}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451058","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451058","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:45Z","timestamp":1750197705000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":83,"alternative-id":["10.1145\/3406325.3451058","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451058","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}