, asymptotic upper bound, asymptotic lower bound.
(definition)
Definition: When the asymptotic complexity of an algorithm exactly matches the theoretically proven 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 (paul.black@nist.gov).
Entry modified Wed Jan 2 09:33:06 2002.
HTML page formatted Thu Jan 31 13:48:11 2002.
This page's original URL is http://www.nist.gov/dads/HTML/asymptoticallyTightBound.html