n(k1, k2) equals 2k1 + 2k2 - 4, proving the diagonal case conjecture and establishing the matching lower bound in general.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
years
2026 4representative citing papers
Graph theory characterizes BVA reencodings, proving any 2-CNF on n variables can be reduced to roughly 0.396 n²/lg n clauses with minor extra steps and that at-most-one needs at least 3n-6 clauses.
Gives an approximation algorithm for satisfiable instances of generalized linear equation CSPs over finite groups that is optimal for certain S, while the predicate remains approximation resistant on almost-satisfiable instances.
Obtains a tight competitive ratio for the online Connectivity Augmentation Problem, improving prior bounds.
citing papers explorer
-
Sharp bounds for covering with large cliques and independent sets
n(k1, k2) equals 2k1 + 2k2 - 4, proving the diagonal case conjecture and establishing the matching lower bound in general.
-
Automated Reencoding Meets Graph Theory
Graph theory characterizes BVA reencodings, proving any 2-CNF on n variables can be reduced to roughly 0.396 n²/lg n clauses with minor extra steps and that at-most-one needs at least 3n-6 clauses.
-
Optimal Inapproximability of Generalized Linear Equations over a Finite Group
Gives an approximation algorithm for satisfiable instances of generalized linear equation CSPs over finite groups that is optimal for certain S, while the predicate remains approximation resistant on almost-satisfiable instances.
-
Online Connectivity Augmentation
Obtains a tight competitive ratio for the online Connectivity Augmentation Problem, improving prior bounds.