{"version":"1.0","type":"link","title":"PolyL - Newikis","description":"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. In other words, polyL = DSPACE((log n)O(1)), where n…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}