Recursion Theory and Computational Complexity
From MaRDI portal
Publication:3173446
DOI10.1007/978-3-642-11072-6zbMath1225.03004OpenAlexW118368417MaRDI QIDQ3173446
No author found.
Publication date: 10 October 2011
Full work available at URL: https://doi.org/10.1007/978-3-642-11072-6
Proceedings of conferences of miscellaneous specific interest (00B25) Complexity of computation (including implicit computational complexity) (03D15) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Applications of computability and recursion theory (03D80)
This page was built for publication: Recursion Theory and Computational Complexity
