Talk:Criss-cross algorithm
Appearance
![]() | Mathematics Start‑class Mid‑priority | |||||||||
|
![]() | Computer science Start‑class Mid‑importance | ||||||||||||||||
|
![]() | Systems: Operations research Start‑class Mid‑importance | ||||||||||||
|
I nominated the following hook: Kiefer.Wolfowitz (Discussion) 00:57, 22 March 2011 (UTC)
- Did you know ... that the criss-cross algorithm and the simplex algorithm are not polynomial-time algorithms because they visit all 2D corners of the Klee–Minty cube in dimension D?
Categories:
- Start-Class mathematics articles
- Mid-priority mathematics articles
- Start-Class Computer science articles
- Mid-importance Computer science articles
- WikiProject Computer science articles
- Start-Class Systems articles
- Mid-importance Systems articles
- Systems articles in operations research
- WikiProject Systems articles