scientific article; zbMATH DE number 512853
From MaRDI portal
Publication:4281549
zbMath0791.68065MaRDI QIDQ4281549
Rolf Niedermeier, Peter Rossmanith
Publication date: 13 June 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexity classesguarded accesslocally definable acceptance typesoracle accesspolynomially time bounded Turing machines
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (2)
Unambiguous computations and locally definable acceptance types ⋮ On the probabilistic closure of the loose unambiguous hierarchy
This page was built for publication: