Content deleted Content added
No edit summary |
Eregli bob (talk | contribs) →Dodgy Map: new section |
||
Line 470:
::I agree with you. My point is: if you say "''one is interested in proving upper and lower bounds on the '''minimum''' amount of time required by the most efficient algorithm solving a given problem''", I get that considering the most efficient algorithm, you say that the complexity is the time it spend in its best-case. In other words, it seems to me that the best-fitting formalization for that proposition above is <math>\min_{x\in X} \{time(T(x))\}</math> where <math>X</math> is the set of possible input and <math>T</math> is the most efficient algorithm. <small><span class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Natematic|Natematic]] ([[User talk:Natematic|talk]] • [[Special:Contributions/Natematic|contribs]]) 19:25, 18 November 2012 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot-->
== Dodgy Map ==
Why does the map showing the shortest route to visit 15 german cities, only actually visit 14 of them ?[[User:Eregli bob|Eregli bob]] ([[User talk:Eregli bob|talk]]) 11:19, 11 May 2013 (UTC)
| |||