Dichotomy theorem identifies Boolean constraint families where O(1)-essential constraints can be detected in polynomial time for MinCSP, enabling search-space reduction for FPT algorithms.
The Constraint Satisfaction Problem: Complexity and Approximability , series =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Search-space Reduction for Boolean MinCSPs via Essential Constraints
Dichotomy theorem identifies Boolean constraint families where O(1)-essential constraints can be detected in polynomial time for MinCSP, enabling search-space reduction for FPT algorithms.