scientific article
From MaRDI portal
Publication:3670562
zbMath0521.68043MaRDI QIDQ3670562
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polynomial-time hierarchynondeterministic exponential timecomplexity hierarchyalternating Turing machinesoracle setsalternating complexity classesrelativized complexity theorysecond-order hierarchy
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)
Related Items (5)
Relativized alternation and space-bounded computation ⋮ Complexity of Propositional Independence and Inclusion Logic ⋮ Non-deterministic exponential time has two-prover interactive protocols ⋮ The role of rudimentary relations in complexity theory ⋮ Bounding queries in the analytic polynomial-time hierarchy
This page was built for publication: