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.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 26 April 2021.
HTML page formatted Mon Apr 26 09:29:23 2021.
Cite this as:
Paul E. Black, "polynomial", in Dictionary 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