scientific article; zbMATH DE number 1414307
From MaRDI portal
Publication:4942644
zbMath0941.68579MaRDI QIDQ4942644
Publication date: 16 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria ⋮ Helping by unambiguous computation and probabilistic computation ⋮ Nondeterministic \(NC^1\) computation
