superpolylogarithmic
English edit
Etymology edit
Adjective edit
superpolylogarithmic (not comparable)
- (mathematics) growing faster than any polynomial but slower than any exponential function.
- 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)
- The polylogarithmic bound on g is necessary. To see this, let f(x) = Σxi, and let g(x) be |x|/2 (or any other superpolylogarithmic threshold).
- 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)
- Lindzey noticed that it is possible to speed-up [sic] 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.
- 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)