Meanings
- not comparablemathematicsgrowing faster than any polynomial but slower than any exponential function.
The polylogarithmic bound on g is necessary. To see this, let f(x) = Σxᵢ, and let g(x) be |x|/2 (or any other superpolylogarithmic threshold).
2003, Jiri Wiedermann, Peter van Emde Boas, Mogens Nielsen, Automata, Languages and Programming: 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999 Proceedings (page 152)1 more example
Lindzey noticed that it is possible to speed-up several graph algorithms using switching to a lower number of edges - he obtained up to superpolylogarithmic speed-ups of algorithms for diameter, transitive closure, bipartite maximum matching and general maximum matching.
2016, Thang N. Dinh, My T. Thai, Computing and Combinatorics: 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings (page 169)
Origin
Cite this entry
superpolylogarithmic. (n.d.). In WatkinsX Dictionary. Retrieved November 3, 2026, from https://dictionary.watkinsx.com/word/superpolylogarithmic
“superpolylogarithmic.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/superpolylogarithmic. Accessed November 3, 2026.
WatkinsX Dictionary, s.v. “superpolylogarithmic,” accessed November 3, 2026, https://dictionary.watkinsx.com/word/superpolylogarithmic.
Source: superpolylogarithmic on Wiktionary, CC BY-SA 4.0.