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).
Source: wiktionary
Ranked by relevance and common usage.
2 total sentences available.
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).
Source: wiktionary
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.
Source: wiktionary
Data sourced from Wiktionary, WordNet, CMU, and other open linguistic databases. Updated March 2026.