{"version":"1.0","type":"link","title":"PSPACE - Newikis","description":"In computational complexity theory, PSPACE is the set of all decision problems that can be solved by a Turing machine using a polynomial amount of space.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/a/ad/Complexity-classes-polynomial.svg/1280px-Complexity-classes-polynomial.svg.png","thumbnail_width":1280,"thumbnail_height":1585}