The polynomial hierarchy of functions and its levels
type: Item
instance of: scholarly article
title: The polynomial hierarchy of functions and its levels
published in: Theoretical Computer Science
publication date: 2021-12-22T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7450579
zbMATH Keywords: implicit complexity
zbMATH Keywords: tree-recursion
zbMATH Keywords: polynomial hierarchy
author: Isabel Oitavem
MaRDI profile type: Publication
full work available at URL: j.tcs.2021.11.016
OpenAlex ID: W3216020848
cites work: Q3996675
cites work: Q4850544
cites work: A new recursion-theoretic characterization of the polytime functions
cites work: Separating NC along the \(\delta\) axis
cites work: Monotonicity constraints in characterizations of PSPACE
cites work: Q3800030
cites work: Handbook of computability theory
cites work: Q5586401
cites work: Characterizing NC with tier 0 pointers
cites work: Characterizing PSPACE with pointers
cites work: A recursion-theoretic approach to NP
DOI: 10.1016/J.TCS.2021.11.016
Recommended article: Q4936674
Recommended article: Inverting Onto Functions and Polynomial Hierarchy
Recommended article: The level of pairs of polynomials
Recommended article: Notes on polynomial levelability
Recommended article: Relativized polynomial hierarchies extending two levels
Recommended article: Nested canalyzing, unate cascade, and polynomial functions
Recommended article: Hyper-polynomial hierarchies and the polynomial jump
Recommended article: Q3714318
Recommended article: Function operators spanning the arithmetical and the polynomial hierarchy
Recommended article: Polynomial-time hierarchies on some classes of functions. I
description: scientific article; zbMATH DE number 7450579