Wikipedia

Talk:Computational complexity

This is an old revision of this page, as edited by Martin Ziegler (talk | contribs) at 18:00, 5 July 2016 (computational complexity of an algorithm is an oxymoron). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Latest comment: 9 years ago by Martin Ziegler
‹ The template below (WikiProject Disambiguation) is being considered for merging with Talk page of disambiguation page. See templates for discussion to help reach a consensus. ›
WikiProject iconDisambiguation
WikiProject iconThis article is within the scope of WikiProject Disambiguation, an attempt to structure and organize all disambiguation pages on Wikipedia. If you wish to help, you can edit the page attached to this talk page, or visit the project page, where you can join the project or contribute to the discussion.DisambiguationWikipedia:WikiProject DisambiguationTemplate:WikiProject DisambiguationDisambiguation

The resources (time, space, ...) used by an algorithm are subsumed as its cost.

Computational complexity is the cost of a problem as incurred by an (asymptotically) optimal algorithm.

Martin Ziegler (talk) 18:00, 5 July 2016 (UTC)Reply

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Computational_complexity&oldid=728474747"