Computer science2011 · shared on Hacker News
Why the Simplex Algorithm Usually Takes Polynomial Time (2001)
Explore Why the Simplex Algorithm Usually Takes Polynomial Time (2001), its original source and Hacker News discussions. Discover community perspectives and save it to your reading list.
GO BEYOND THE ABSTRACT
The conversation around the idea.
Original Hacker News threads. Different perspectives, questions, and things worth thinking about.
Showing up to 100 related threads. A paper may appear in a comment rather than the original submission.
Links found in the discussion
Up to 50 recent source links, in HN item order.
Ycaustic ·
The polynomial algorithm for 3-SAT problem (or P=NP)
269 points142 comments
Yluu ·
Linear Programming: How Does It Work?
200 points57 comments
Yapwheele ·
Suits, money laundering, and linear programming
75 points30 comments
Yhaltingproblem ·
The Simplex Solution: Why it works so well
51 points16 comments
Yfforflo ·
Why the Simplex Algorithm Usually Takes Polynomial Time (2001)
3 points0 comments