Subexponential-Time Exact-One Hitting Set
cs.DS
Submitted: 2026-10-31
Updated: 2026-10-31
Comments: 33 pages, full version including proofs and appendices
Code: https://github.com/ono-work/sat-algorithm-consequences
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- 2 Notes on Classes with Vapnik-Chervonenkis Dimension 1
- Binary Programming Formulations for the Upper Domination Problem
- Improved Algorithms for the General Exact Satisfiability Problem
- Dancing links
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time