The Analytic Polynomial-Time Hierarchy

DOI10.1002/malq.19980440412zbMath0920.03051OpenAlexW2013344444MaRDI QIDQ4224087

Herbert Baier, Klaus 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

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

Related Items (1)

Bounding queries in the analytic polynomial-time hierarchy

Cites Work

• Unnamed Item
• Unnamed Item

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