Talk:Computational complexity

This is an old revision of this page, as edited by D.Lazard (talk | contribs) at 16:41, 3 December 2017 (project banners). 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 in topic Old post

Old post

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