Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMath1135.68016OpenAlexW2494705596MaRDI QIDQ5492874

A. Pavan, Christian Glaßer, Ogihara, Mitsunori, Liyu Zhang, Selman, Alan L.

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (4)

Query-monotonic Turing reductions ⋮ Autoreducibility, mitoticity, and immunity ⋮ On the autoreducibility of functions ⋮ Pushdown dimension

This page was built for publication: Mathematical Foundations of Computer Science 2005