Accumulating Pruning Constraints: New Exact Polynomial-Space Algorithms for Max 2-SAT
Title card · GETSECURE.ai
We present deterministic polynomial-space algorithms that solve Max 2-SAT on $n$ variables exactly in time $\Ostar(2^{(1-γ)n})$, for a fixed $γ>0$, on several classes of
Excerpt from arXiv AI
GETSECURE.ai hasn't published its own summary of this story yet. The complete report is at arXiv AI:
arXiv AI. (2026, October 29). Accumulating Pruning Constraints: New Exact Polynomial-Space Algorithms for Max 2-SAT. arXiv AI. https://arxiv.org/abs/2610.39992v1
