The polynomial hierarchy of functions and its levels

DOI10.1016/j.tcs.2021.11.016OpenAlexW3216020848MaRDI QIDQ2062128

Isabel Oitavem

Publication date: 22 December 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.11.016

zbMATH Keywords

polynomial hierarchyimplicit complexitytree-recursion

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

Implicit recursion-theoretic characterizations of counting classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A recursion-theoretic approach to NP
• A new recursion-theoretic characterization of the polytime functions
• Handbook of computability theory
• Separating NC along the \(\delta\) axis
• Monotonicity Constraints in Characterizations of PSPACE
• Characterizing PSPACE with pointers
• Characterizing NC with tier 0 pointers