cs.DS · 2026-11-01 · No. 160

Data Structures and Algorithms, 2026-11-01.

1 new papers in cs.DS. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

1 entries
  1. 01

    Accumulating Pruning Constraints: New Exact Polynomial-Space Algorithms for Max 2-SAT

    Konstantin Kutzkov

    cs.DS · cs.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 instances whose clause density may grow with $n$. Our main tool extends the classic DPLL branching algorithm. When the search gives a variable its less promising value, comparing the two values of the variable yields a pruning constraint that is satisfied by some optimal...

    arxiv.org/abs/2610.39992 · PDF

This edition is part of The Daily Abstract — cs.DS archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.