Talk:Computational complexity: Difference between revisions

Content deleted Content added
Created page with '{{WP Disambiguation}}'
 
computational complexity of an algorithm is an oxymoron
Line 1:
{{WP Disambiguation}}
 
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.
 
[[User:Martin Ziegler|Martin Ziegler]] ([[User talk:Martin Ziegler|talk]]) 18:00, 5 July 2016 (UTC)