(definition)
Definition: When the asymptotic complexity of an algorithm exactly matches the theoretically proved asymptotic complexity of the corresponding problem. Informally, when an algorithm solves a problem at the theoretical minimum.
See also Θ, asymptotic upper bound, asymptotic lower bound.
Author: SKS
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Sandeep Kumar Shukla, "asymptotically tight bound", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/asymptoticallyTightBound.html
