scientific article; zbMATH DE number 2154085
From MaRDI portal
Publication:4664632
zbMath1061.03044MaRDI QIDQ4664632
Publication date: 8 April 2005
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) Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55)
Related Items (13)
Towards a descriptive set theory for domain-like structures ⋮ Definability of closure operations in the \(h\)-quasiorder of labeled forests ⋮ Fine hierarchies via Priestley duality ⋮ The Boolean hierarchy of NP-partitions ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ Labeled posets are universal ⋮ On the Difference Hierarchy in Countably Based T0-Spaces ⋮ On the Wadge Reducibility of k-Partitions ⋮ Theories of orders on the set of words ⋮ Complexity Issues for Preorders on Finite Labeled Forests ⋮ A Fine Hierarchy of ω-Regular k-Partitions ⋮ Definability in the \(h\)-quasiorder of labeled forests ⋮ On the Wadge reducibility of \(k\)-partitions
This page was built for publication:
