The polynomially exponential time restrained analytical hierarchy
From MaRDI portal
Publication:1337640
DOI10.1007/BF02945517zbMath0813.03024OpenAlexW2086306089MaRDI QIDQ1337640
Publication date: 7 June 1995
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02945517
polynomial timeoracledeterministic Turing machinepolynomially analytical hierarchypolynomially exponential time
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Turing machines and related notions (03D10)
Cites Work
This page was built for publication: The polynomially exponential time restrained analytical hierarchy