scientific article; zbMATH DE number 1414285
From MaRDI portal
Publication:4942622
zbMath0941.03544MaRDI QIDQ4942622
Publication date: 16 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Hierarchies of computability and definability (03D55)
Related Items (11)
Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies ⋮ Query order in the polynomial hierarchy ⋮ Fine hierarchy of regular \(\omega\)-languages ⋮ Fine hierarchy of regular ω-languages ⋮ The Shrinking Property for NP and coNP ⋮ The shrinking property for NP and coNP ⋮ On the main scientific achievements of Victor Selivanov ⋮ Fine hierarchies via Priestley duality ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ A reducibility for the dot-depth hierarchy ⋮ A note on parallel queries and the symmetric-difference hierarchy.
This page was built for publication:
