scientific article; zbMATH DE number 2154085

MaRDI QIDQ4664632zbMATH OpenFDO

Authors Victor Selivanov

Publication date 8 April 2005

zbMATH Keywords

Boolean hierarchy

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 1500515
• On the Wadge reducibility of \(k\)-partitions
• On the Wadge reducibility of \(k\)-partitions
• The Boolean hierarchy of NP-partitions
• scientific article; zbMATH DE number 1759433

Cited in

(18)

• Definability in the \(h\)-quasiorder of labeled forests
• On the Wadge reducibility of \(k\)-partitions
• NP-partitions over posets with an application to reducing the set of solutions of NP problems
• Labeled posets are universal
• Complexity issues for preorders on finite labeled forests
• A Fine Hierarchy of ω-Regular k-Partitions
• Theories of orders on the set of words
• Fine hierarchies via Priestley duality
• scientific article; zbMATH DE number 1759433 (Why is no real title available?)
• On the difference hierarchy in countably based \(T_{0}\)-spaces
• On the Wadge reducibility of \(k\)-partitions
• Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
• Definability of closure operations in the \(h\)-quasiorder of labeled forests
• Ordinal invariants of the h-preorder on k-labeled forests
• A classification of the Wadge hierarchies on zero-dimensional Polish spaces
• Towards a descriptive set theory for domain-like structures
• The Boolean hierarchy of NP-partitions
• Fine hierarchies and m-reducibilities in theoretical computer science

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4664632)