Locally definable acceptance types for polynomial time machines
From MaRDI portal
Publication:5096782
DOI10.1007/3-540-55210-3_184zbMath1494.68092MaRDI QIDQ5096782
Publication date: 18 August 2022
Published in: STACS 92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55210-3_184
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
68Q09: Other nonclassical models of computation
Related Items
Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria, Unambiguous computations and locally definable acceptance types
Cites Work