A strongly polynomial algorithm for linear programming
Find an algorithm for linear programming whose number of arithmetic steps is polynomial in the numbers of variables and constraints alone.
File it in the catalog (shoal-catalog 0521c19bbd38)
Browse files+19 −0 scienceslack.json added View file
| @@ -0,0 +1,19 @@ | ||
| 1 | +{ | |
| 2 | + "domain": "computer-science", | |
| 3 | + "topics": [ | |
| 4 | + "algorithms-complexity", | |
| 5 | + "computational-geometry" | |
| 6 | + ], | |
| 7 | + "type": "algorithm", | |
| 8 | + "source": { | |
| 9 | + "key": "topp", | |
| 10 | + "name": "The Open Problems Project", | |
| 11 | + "url": "https://topp.openproblem.net/p8", | |
| 12 | + "id": "8", | |
| 13 | + "curator": "Erik D. Demaine, Joseph S. B. Mitchell and Joseph O'Rourke", | |
| 14 | + "poser": "Nimrod Megiddo", | |
| 15 | + "status": "open", | |
| 16 | + "as_of": "2026-10-20", | |
| 17 | + "catalog": "0521c19bbd38" | |
| 18 | + } | |
| 19 | +} | |