polynomial (original) (raw)

NIST

(definition)

Definition:(1) Any function which is the sum of constants times powers of the argument: f(x)=Σi=0k cixpi. (2) In complexity theory, the measure of computation, m(n) (usually execution time or memory space), is bounded by a polynomial function of the problem size, n. More formally m(n) = O(nk).

See also logarithmic, linear, exponential.

Note: Strictly speaking, a linear function is a polynomial with the highest exponent being 1, and a logarithmic function is a polynomial with fractional exponents. However polynomial usually means exponents greater than 1.

Author: PEB

Go to theDictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 26 April 2021.
HTML page formatted Wed Oct 30 12:15:31 2024.

Cite this as:
Paul E. Black, "polynomial", inDictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 26 April 2021. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/polynomial.html