Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492883
DOI10.1007/11549345zbMath1156.68386OpenAlexW2494705596MaRDI QIDQ5492883
Arfst Nickelsen, André Hernich
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11549345
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Other degrees and reducibilities in computability and recursion theory (03D30)
This page was built for publication: Mathematical Foundations of Computer Science 2005