scientific article
From MaRDI portal
Publication:3779736
zbMath0638.68027MaRDI QIDQ3779736
Thomas Gundermann, Gerd Wechsung
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items
Simultaneous strong separations of probabilistic and unambiguous complexity classes, On the power of parity polynomial time, Locally definable acceptance types for polynomial time machines, Hierarchies and reducibilities on regular languages related to modulo counting, On the acceptance power of regular languages, On the power of parity polynomial time, Probabilistic polynomial time is closed under parity reductions, A second step towards complexity-theoretic analogs of Rice's Theorem, A reducibility for the dot-depth hierarchy
