Context: This is an front-page article on the New York Times about Karmarkar's polynomial time Linear Programming algorithm [1].<p>I found it amusing. Imagine an article about theoretical computer science making it to the front page of NYT today!<p>Aside: I learned about this from the first lecture in Boyd's fantastic course on Convex Optimization, which is available for free online [2]. Very excited for this, he's a great lecturer :)<p>[1] <a href="https://en.wikipedia.org/wiki/Karmarkar%27s_algorithm" rel="nofollow">https://en.wikipedia.org/wiki/Karmarkar%27s_algorithm</a>
[2] <a href="https://learning.edx.org/course/course-v1:StanfordOnline+SOE-YCVX0001+1T2020/home" rel="nofollow">https://learning.edx.org/course/course-v1:StanfordOnline+SOE...</a>