The CNF Encoding Complexity of Boolean Functions
cs.CC, cs.LO
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
- From the Finite to the Infinite: Sharper Asymptotic Bounds on Norin's Conjecture via SAT
- Asymptotically Smaller Encodings for Graph Problems and Scheduling
- A Near-Linear Element-Kernel for d-Hitting Set
- A Polynomial Kernel for Planar Directed Feedback Vertex Set
- Short lists for shortest descriptions in short time
Related papers
- The Proof Analysis Problem for Constant-Depth Frege
- Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
- Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
- Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?