Feasible computability and resource bounded topology

DOI10.1006/inco.1995.1015zbMath0827.68044OpenAlexW1982265314MaRDI QIDQ1891148

Tomoyuki Yamakami

Publication date: 13 December 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1015

zbMATH Keywords

boldface polynomial hierarchyMeyer-Stockmeyer polynomial hierarchy

Mathematics Subject Classification ID

Descriptive set theory (03E15) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (5)

A tight relationship between generic oracles and type-2 complexity theory ⋮ Structural properties for feasibly computable classes of type two ⋮ Polynomial games and determinacy ⋮ Unnamed Item ⋮ A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY

This page was built for publication: Feasible computability and resource bounded topology