Definitions from Wikipedia (PolyL)

▸ noun:  In computational complexity theory, polyL is the complexity class of decision problems that can be solved on a deterministic Turing machine by an algorithm whose space complexity is bounded by a polylogarithmic function in the size of the input.


▸ Words similar to polyl
▸ Usage examples for polyl

▸ Idioms related to polyl
▸ Wikipedia articles (New!)
▸ Popular adjectives describing polyl
▸ Words that often appear near polyl
▸ Rhymes of polyl

▸ Invented words related to polyl