{"version":"1.0","type":"link","title":"FIXP - Newikis","description":"In computer science, FIXP is a complexity class introduced by Kousha Etessami and Mihalis Yannakakis at 2010. It represents problems that can be solved by computing a fixed point of a function that satisfies the conditions of Brouwer's fixed point theorem. More formally, FIXP contains search…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}