The Analytic Polynomial-Time Hierarchy

DOI10.1002/MALQ.19980440412MaRDI QIDQ4224087zbMATH OpenOpenAlexFDO

Authors Herbert Baier, K. W. Wagner

Publication date 31 August 1999

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19980440412

zbMATH Keywords

analytic polynomial-time hierarchy

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Bounding queries in the analytic polynomial-time hierarchy
• The polynomially exponential time restrained analytical hierarchy
• The polynomial-time hierarchy and oracle set \(A \in \text{PH/poly}\)

Cited in

(6)

• Bounding queries in the analytic polynomial-time hierarchy
• The polynomially exponential time restrained analytical hierarchy
• Applicative theories for the polynomial hierarchy of time and its levels
• Proper hierarchies in polylogarithmic time and absence of complete problems
• scientific article; zbMATH DE number 1018738 (Why is no real title available?)
• The relative complexity of analytic tableaux and SL-resolution

This page was built for publication: The Analytic Polynomial-Time Hierarchy

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