| 
|
Quote: use big-Oh, Omega and Theta notations for complexity analysis; first appearance in 1894
topics >
all references >
references i-l >
Topic:
algorithmic complexity analysis
Quotation Skeleton
Most of us have gotten accustomed to the … a constant times f(n), for all large n. … [p. 19] I found Landau's remark [ref] that the … [Backmann, P., Die Analytische Zahlentheorie. Zahlentheorie, pt. 2, 1894, p. 401]. … [p. 20] Verbally, O(f(n)) can be read as "order … [p. 23] Well, I think I have beat this … On the basis of the issues discussed here, … O, .Omega., and .Theta. notations as defined above, … of Hardy be adopted in those situations where … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: algorithmic complexity analysis (10 items)