scientific article
From MaRDI portal
Publication:3686041
zbMath0569.68039MaRDI QIDQ3686041
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
classificationspace complexitylanguage recognitiondeterministic complexitynon-deterministic complexity
Related Items (4)
Topological invariants of classification problems ⋮ Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree ⋮ Polynomial size \(\Omega\)-branching programs and their computational power ⋮ Coxeter groups and nonuniform complexity
This page was built for publication: