(definition)
Definition: An asymptotic bound, as function of the size of the input, on the best (fastest, least amount of space used, etc.) an algorithm can possibly achieve to solve a problem. That is, no algorithm can use fewer resources than the bound.
See also Ω, asymptotic upper bound, asymptotically tight bound.
Author: SKS
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:02:17 2004.
HTML page formatted Wed Oct 26 09:47:12 2005.
Cite this as:
Sandeep Kumar Shukla, "asymptotic lower bound", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/asymptoticLowerBound.html
