scientific article
From MaRDI portal
Publication:3795666
zbMath0651.03030MaRDI QIDQ3795666
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items
Negative Boolean constraints, Dominoes and the complexity of subclasses of logical theories, A multiparameter analysis of domino tiling with an application to concurrent systems, Turing machines with access to history, Simple sentences that are hard to decide