{"version":"1.0","type":"link","title":"Descriptive complexity theory - Newikis","description":"Descriptive complexity is a branch of computational complexity theory and of finite model theory that characterizes complexity classes by the type of logic needed to express the languages in them. For example, PH, the union of all complexity classes in the polynomial hierarchy, is precisely the…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}