Completeness in the Boolean Hierarchy

Riege, T., & Rothe. (2006). Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems - a Survey.

Type

Unclassified

Intellectual base

Unclassified

Year

2006

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Boolean hierarchy
  • … decision-language universe and reductions, base NP class, recursive level definition and indexing, union hierarchy, named subclasses such as DP, closure facts and collapse implication are explicit. to An applied instance preserves the invariant under changed notation, scale, dataset, jurisdiction, or implementation..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:72564f196b87 · see in the full table