Content deleted Content added
→[[WP:LEAD|Lede]]: update maths rating |
→algorithm: Lack of explicit construction of the algorithm |
||
Line 33:
-- [[User:Obradovic Goran|Obradović Goran ]] [[User talk:Obradovic Goran|(<font color="red">t</font><font color="blue">a<sup>l</sup></font><font color="gray">k</font>]] 20:08, 17 May 2008 (UTC)
The article currently suggests that the algorithm does exist explicitly but doesn't give it with no explanation as to why. Having read the 1990 paper, it looks like this is because the algorithm is not explicitly constructed, only its existence is given. Can this be made clearer in the article? The suggestion that the algorithm isn't used in practice because it is slow for plausibly sized matrices is also questionable, is it not the case that the algorithm isn't used in practice because it hasn't been explicitly constructed [and possibly also too slow]? --[[Special:Contributions/131.111.213.41|131.111.213.41]] ([[User talk:131.111.213.41|talk]]) 03:28, 12 June 2009 (UTC)
== ?! ==
| |||