Talk:Criss-cross algorithm: Difference between revisions

Revision as of 01:31, 23 March 2011

Revision as of 21:44, 24 March 2011

Line 5:

==[[Template_talk:Did_you_know#Criss-cross_algorithm|Did You Know?]]==

===Old nomination: Inaccessible===

{{hidden begin}}

[[Template_talk:Did_you_know#Criss-cross_algorithm|I nominated the following hook]]: <small><span style="border:1px solid black;padding:1px;">[[User:Kiefer.Wolfowitz|<font style="color:blue;background:yellow;">&nbsp;'''Kiefer'''.'''Wolfowitz'''&nbsp;</font>]]</span></small>&nbsp;([[User talk:Kiefer.Wolfowitz#top|Discussion]]) 00:57, 22 March 2011 (UTC)

Line 14 ⟶ 15:

::Caveat: I have not yet provided a reference to the expected behavior of the criss cross algorithm (which is D on cubes of dimension D, I believe). The expected number of steps of the simplex algorithm is also linear under a wide class of models (which are incompatible with reality, alas); the expected running time is usually thought to be about 3D on practical problems.

::I simplified it a bit. <small><span style="border:1px solid black;padding:1px;">[[User:Kiefer.Wolfowitz|<font style="color:blue;background:yellow;">&nbsp;'''Kiefer'''.'''Wolfowitz'''&nbsp;</font>]]</span></small>&nbsp;([[User talk:Kiefer.Wolfowitz#top|Discussion]]) 19:59, 22 March 2011 (UTC)

{{hidden end}}

===New hook: Accessible===

::Maybe this would work better?