Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
counterexample |
| gptkbp:dimensions |
n-dimensional
|
| gptkbp:field |
gptkb:mathematics
linear programming |
| https://www.w3.org/2000/01/rdf-schema#label |
Klee–Minty cube
|
| gptkbp:introduced |
gptkb:George_J._Minty
gptkb:Victor_Klee |
| gptkbp:introducedIn |
1972
|
| gptkbp:namedAfter |
gptkb:George_J._Minty
gptkb:Victor_Klee |
| gptkbp:notableFor |
showing simplex algorithm is not polynomial time in worst case
|
| gptkbp:property |
exponential time complexity for simplex algorithm
simplex algorithm visits all vertices |
| gptkbp:purpose |
demonstrate worst-case performance of simplex algorithm
|
| gptkbp:relatedTo |
gptkb:simplex_algorithm
linear programming polytopes |
| gptkbp:shape |
distorted hypercube
|
| gptkbp:bfsParent |
gptkb:Victor_Klee
|
| gptkbp:bfsLayer |
5
|