scientific article; zbMATH DE number 1396725

zbMath0932.03052MaRDI QIDQ4936674

Victor L. Selivanov

Publication date: 31 January 2000

Full work available at URL: https://eudml.org/doc/187897

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

recursioncomputabilitypolynomial hierarchydifference hierarchy

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20) Hierarchies of computability and definability (03D55)

Related Items (4)

Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies ⋮ The shrinking property for NP and coNP ⋮ Fine hierarchies via Priestley duality ⋮ Fine hierarchies and m-reducibilities in theoretical computer science

This page was built for publication: