Proves δ_{C_ℓ} = ℓ/(2ℓ-2) for odd ℓ ≥ 73.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 4verdicts
UNVERDICTED 4roles
background 1polarities
unclear 1representative citing papers
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.
Bounded fitting can be extended to expressive description logics while retaining generalization guarantees and implemented practically via SAT solvers.
Presents O(nr²) DP algorithms for r-edge and r-facility interdiction covering on trees (and bounded treewidth for the edge version), proves RFIC NP-complete, and gives an O(n³) algorithm for SSBVE on trees.
citing papers explorer
-
Bounded Fitting for Expressive Description Logics
Bounded fitting can be extended to expressive description logics while retaining generalization guarantees and implemented practically via SAT solvers.