scientific article; zbMATH DE number 1500515

zbMath0959.68521MaRDI QIDQ4501530

Sven Kosub, Klaus W. Wagner

Publication date: 3 May 2001

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

zbMATH Keywords

Boolean hierarchy

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (16)

Hierarchies of Δ⁰₂‐measurable k ‐partitions ⋮ Descending chains and antichains of the unary, linear, and monotone subfunction relations ⋮ Fine hierarchies via Priestley duality ⋮ On the homomorphism order of labeled posets ⋮ 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 ⋮ Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms ⋮ 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 ⋮ Reducing the number of solutions of NP functions

This page was built for publication: