Revision as of 03:05, 22 March 2011 edit Kiefer.Wolfowitz (talk \| contribs) 39,688 edits →DYK: the '''criss-cross algorithm''' and the simplex algorithm are not polynomial-time algorithms for linear-optimization because they visit all 2<sup>''D''</sup> corners of the Klee-Minty ← Previous edit		Revision as of 03:06, 22 March 2011 edit undo Kiefer.Wolfowitz (talk \| contribs) 39,688 edits →DYK: that the '''criss-cross algorithm''' and the simplex algorithm are not polynomial-time algorithms <!-- for linear optimization --> because they visit all 2<sup>''D''</sup> corners of t Next edit →
Line 6: I suggest teh following hook: <small><span style="border:1px solid black;padding:1px;">[[User:Kiefer.Wolfowitz\|<font style="color:blue;background:yellow;"> '''Kiefer'''.'''Wolfowitz''' </font>]]</span></small> ([[User talk:Kiefer.Wolfowitz#top\|Discussion]]) 00:57, 22 March 2011 (UTC) * Did you know ... that the '''[[criss-cross algorithm]]''' and the [[simplex algorithm]] are not [[time complexity\|polynomial-time algorithm]]s <!-- for [[linear programming\|linear- optimization]] --> because they visit all 2<sup>''D''</sup> corners of the [[Victor Klee~~-Minty~~\|Klee]]–Minty cube in [[dimension (vector space)\|dimension]] ''D''?

Talk:Criss-cross algorithm: Difference between revisions