Mathematical Foundations of Computer Science 2003

DOI10.1007/b11836zbMath1124.03323OpenAlexW2495578842MaRDI QIDQ5431301

Ambos-Spies, Klaus

Publication date: 7 December 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11836

Mathematics Subject Classification ID

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)

Related Items

Sets without subsets of higher many-one degree, Degrees of sets having no subsets of higher m- and t t-degree