scientific article; zbMATH DE number 3609651
From MaRDI portal
Publication:4175545
zbMath0393.03028MaRDI QIDQ4175545
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexitypolynomial timehierarchyelementary setshigher typesnon-deterministic Turing machinepolynomially bounded quantification
Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)
Related Items