Polylogarithmic

From Wikipedia, the free encyclopedia

This article or section does not cite its references or sources.
Please help improve this article by introducing appropriate citations. (help, get involved!) This article has been tagged since October 2006.

A polylogarithmic function in n is a polynomial in the logarithm of n,

a_k \log^k(n) + \cdots + a_1 \log(n) + a_0.

In computer science, polylogarithmic functions occur as the order of some algorithms (e.g., "it has polylogarithmic order").

All polylogarithmic functions are

P_l(x) = O(x^\epsilon)\,

for every exponent ε > 0 (for the meaning of this symbol, see big O notation), that is, a polylogarithmic function grows slower than any positive exponent.

Not to be confused with polylogarithms.


 This mathematics-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../p/o/l/Polylogarithmic.html"