Independent set, vertex cover, k-coloring and clique admit CNF encodings with O(n^2/log n) clauses, and the disjoint-intervals encoding needs only O(n^2 log n) clauses.
Computing NP-Hard Repetitiveness Measures via MAX-SAT (under review), 2025
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Asymptotically Smaller Encodings for Graph Problems and Scheduling
Independent set, vertex cover, k-coloring and clique admit CNF encodings with O(n^2/log n) clauses, and the disjoint-intervals encoding needs only O(n^2 log n) clauses.