polylogarithmic time
Description: A computational complexity bound describing algorithms whose running time grows as a polylogarithmic function of the input size.
Primary topic: Complexity and Algorithms in Graphs (52%)
Related topic: Complexity and Algorithms in Graphs (52%)
OpenAlex ID: keywords/polylogarithmic-time
