Feasible computability and resource bounded topology
From MaRDI portal
Publication:1891148
DOI10.1006/inco.1995.1015zbMath0827.68044MaRDI QIDQ1891148
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
03E15: Descriptive set theory
03D15: Complexity of computation (including implicit computational complexity)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Unnamed Item, A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY, A tight relationship between generic oracles and type-2 complexity theory, Polynomial games and determinacy, Structural properties for feasibly computable classes of type two