(definition)

**Definition:**
(1) Any function that is a constant times the logarithm of the argument: f(x)=c log x. (2) In complexity theory, when the measure of computation, m(n) (usually execution time or memory space), is bounded by a logarithmic function of the problem size, n. More formally m(n) = *O(log n)*. (3) Sometimes imprecisely used to mean *polylogarithmic*.

**Generalization** (I am a kind of ...)

*sublinear time algorithm*.

**See also**
*linear*, *polynomial*, *exponential*.

Author: PEB

Go to the Dictionary of Algorithms and Data Structures home page.

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:

Paul E. Black, "logarithmic", 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/logarithmic.html