Recursion Theory and Computational Complexity

DOI10.1007/978-3-642-11072-6MaRDI QIDQ3173446zbMATH OpenOpenAlexFDO

Authors

Publication date 10 October 2011

Full work available at URL https://doi.org/10.1007/978-3-642-11072-6

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Complexity of computation (including implicit computational complexity) (03D15) Applications of computability and recursion theory (03D80)

Recommendations

• scientific article; zbMATH DE number 5964925
• Theoretical computer sciences. Lectures given at a summer school of the Centro Internazionale Matematico Estivo (C.I.M.E.) held in Bressanone (Bolzano), Italy, June 9--14, 1975
• Recursion theory and complexity. Proceedings of the Kazan '97 workshop, Kazan, Russia, July 14--19, 1997
• scientific article; zbMATH DE number 2110413
• scientific article; zbMATH DE number 5778850
• scientific article; zbMATH DE number 176033
• scientific article; zbMATH DE number 738396
• scientific article; zbMATH DE number 702378
• scientific article; zbMATH DE number 1313931
• Recursion theory week. Proceedings of a conference held in Oberwolfach, Germany, March 19-25, 1989

This page was built for publication: Recursion Theory and Computational Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3173446)