scientific article; zbMATH DE number 1500515
From MaRDI portal
Publication:4501530
zbMATH Open0959.68521MaRDI QIDQ4501530FDOQ4501530
Authors: Sven Kosub, K. W. Wagner 
Publication date: 3 May 2001
Title of this publication is not available (Why is that?)
Recommendations
Cited In (26)
- Labeled posets are universal
- Theories of orders on the set of words
- The Boolean Hierarchy I: Structural Properties
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Boolean Hierarchy II: Applications
- Descending chains and antichains of the unary, linear, and monotone subfunction relations
- Hierarchies of Δ02‐measurable k ‐partitions
- Fine hierarchies via Priestley duality
- Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms
- Title not available (Why is that?)
- The Boolean hierarchy of NP-partitions
- Fine hierarchies and m-reducibilities in theoretical computer science
- Complexity issues for preorders on finite 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
- Title not available (Why is that?)
- Definability in the \(h\)-quasiorder of labeled forests
- On the homomorphism order of labeled posets
- On the Wadge reducibility of \(k\)-partitions
- Reducing the number of solutions of NP functions
- Partitioning 1-variable Boolean functions for various classification ofn-variable Boolean functions
- A Fine Hierarchy of ω-Regular k-Partitions
- Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams
- A comment on \('NP=P?'\) and restricted partitions
- On the difference hierarchy in countably based \(T_{0}\)-spaces
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 Q4501530)
