Revision as of 02:16, 12 May 2014 edit Lembit Staan (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers 69,433 edits →Dodgy Map ← Previous edit		Revision as of 02:16, 12 May 2014 edit undo Lembit Staan (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers 69,433 edits →Dodgy Map Next edit →
Line 477: 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) :You're right. Other sources also claim that this route covers 15 cities. For example, see [http://www.gizmag.com/d-wave-quantum-computer-supercomputer-ranking/27476/pictures#2]. --[[User:RobinK\|Robin]] ([[User talk:RobinK\|talk]]) 19:14, 14 May 2013 (UTC) ::The answer to the mystery was one mouse click away. Instead of doing [[WP:NOR\|original research]] :-) The image description says that [[~~Dortmind~~Dortmund]] is not labelled in the map (I guess because, as you can see it yourself, there is simply no place for it on the map, despite (or because of) being the largest city in Ruhr area :-) [[User:Staszek Lem\|Staszek Lem]] ([[User talk:Staszek Lem\|talk]]) 02:16, 12 May 2014 (UTC) == Reversal ==

Talk:Computational complexity theory: Difference between revisions