Wikipedia

Talk:Computational complexity

This is an old revision of this page, as edited by D.Lazard (talk | contribs) at 15:13, 27 September 2017 ({{math rating|class=stub|importance = high|field = applied}}). 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
WikiProject iconMathematics Stub‑class High‑priority
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
StubThis article has been rated as Stub-class on Wikipedia's content assessment scale.
HighThis article has been rated as High-priority on the project's priority scale.

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=802648350"