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 and efficient partite decompositions of hypergraphs.CoRR, abs/2511.11855,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Graphs admitting Welzl orders with sublinear-interval neighborhoods have small biclique decompositions, yielding log-factor extensions to bounds on Zarankiewicz, matrix multiplication, quantum circuits, and structured shortest paths.
citing papers explorer
-
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.