(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 Fri Dec 17 12:02:20 2004.
HTML page formatted Wed Oct 26 09:47:12 2005.
Cite this as:
Sandeep Kumar Shukla, "asymptotically tight bound", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/asymptoticallyTightBound.html
