From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem
From MaRDI portal
Publication:5395687
DOI10.1145/2339123.2339124zbMath1281.68115OpenAlexW2059824826MaRDI QIDQ5395687
Publication date: 17 February 2014
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2339123.2339124
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20) Descriptive complexity and finite models (68Q19)
Related Items (1)
This page was built for publication: From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem