Talk:Big O notation: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>D. Matt Innis
(Talk:Big O notation moved to Talk:Complexity of algorithms: per math author request and computer editor approval)
 
imported>Subpagination Bot
m (Add {{subpages}} and remove checklist (details))
 
(2 intermediate revisions by 2 users not shown)
Line 1: Line 1:
#REDIRECT [[Talk:Complexity of algorithms]]
{{subpages}}

Latest revision as of 06:31, 25 September 2007

This article is a stub and thus not approved.
 Main Article
 Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
To learn how to update the categories for this article, see here. To update categories, edit the metadata template.
 Definition:  Mathematical notation to express various upper bounds concerning asymptotic behaviour of functions, e.g. the complexity of algorithms in computer science. [d] [e]
Checklist and Archives
 Workgroup categories:  Mathematics and Computers [Categories OK]
 Talk Archive:  none  English language variant:  British English
Retrieved from "https://citizendium.org/wiki/index.php?title=Talk:Big_O_notation&oldid=20866"