Locally definable acceptance types for polynomial time machines

DOI10.1007/3-540-55210-3_184zbMath1494.68092OpenAlexW1535036176MaRDI QIDQ5096782

Ulrich Hertrampf

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Other nonclassical models of computation (68Q09)

Related Items (2)

Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria ⋮ Unambiguous computations and locally definable acceptance types

Cites Work

• On the construction of parallel computers from various basis of Boolean functions
• Bounded Query Classes
• Alternation
• Counting classes: Thresholds, parity, mods, and fewness
• Unnamed Item

This page was built for publication: Locally definable acceptance types for polynomial time machines