Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.18540

Solving SAT via Treewidth Backdoors in Linear Time: Beyond Sparsity

Jan Dreier·Robert Ganian·Marlene Gründel·Roohani Sharma·Simon Wietheger
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Boolean Satisfiability (SAT) problem is a remarkably expressive computational problem, serving both as a cornerstone of complexity theory and as a unifying language for a wide range of search and reasoning tasks. While $\mathrm{NP}$-complete in general, SAT is well known to be linear-time solvable on instances with bounded treewidth. This motivates the search for "hidden" tree-like structures in formulas---for instance by detecting so-called weak $t$-treewidth backdoors. Such backdoors are sets of $k$ variables that can be assigned in such a way that the remaining instance has treewidth at most $t$ and is satisfiable whenever the original instance is. Ever since Gaspers and Szeider [ICALP 2012] showed that finding a weak $t$-treewidth backdoor for a SAT formula is $\mathrm{W}[2]$-hard with respect to $k$, tractability results have been restricted to structurally sparse formulas---most notably, a linear-time algorithm for $d$-SAT (bounded clause-length SAT) by Fomin, Lokshtanov, Misra, Ramanujan, and Saurabh [SODA 2015] and a non-uniform polynomial-time algorithm when the incidence graph of the input formula belongs to a nowhere-dense graph class (or more generally is $K_{d,d}$-free) by Lokshtanov, Panolan, and Ramanujan [ICALP 2022]. In this paper, we push the tractability boundaries of finding weak $t$-treewidth backdoors beyond sparsity and into the regime of "well-behaved" dense formulas. Aiming towards relaxing structural input restrictions from nowhere-dense to edge-stable graph classes, as featured in the theory of beyond sparsity for FO model checking, or to bounded VC-dimension set systems, we identify signed semi-ladder-freeness as the correct dense structural restriction that establishes the boundary between tractability and intractability along this line.

Explore related subjects

cs.DScs.CC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jan Dreier, Robert Ganian, Marlene Gründel, Roohani Sharma, Simon Wietheger. 2026-10-13. Solving SAT via Treewidth Backdoors in Linear Time: Beyond Sparsity. https://arxiv.org/abs/2610.18540

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adding an Edge in a $P_4$-sparse Graph

For a graph family~${\cal F}$, the minimum ${\cal F}$-completion problem asks for the minimum number of non-edges to be added to a given graph~$G$ so that the resulting graph belongs to the family~${\cal F}$. This problem is NP-complete for many subclasses of perfect graphs, while polynomial solutions are available for minimal completion sets or restricted input. We study the minimum $P_4$-sparse completion problem that arises after adding a prescribed non-edge to a \(P_4\)-sparse graph \(G\), with the resulting graph required to remain \(P_4\)-sparse. For the case in which $G$ consists of two connected components, each containing one endpoint of the added non-edge, we characterize the possible forms of an optimal solution. Combining this characterization with the solution of the other cases identified by the structural decomposition of \(P_4\)-sparse graphs, we obtain an algorithm for the general problem that runs in $O(n^2)$ time and $O(n)$ space.

cs.DS↗
arXiv2026

Optimal Extrapolation Bounds for Sparse Fourier Sums

We prove a sharp extrapolation bound for $k$-sparse Fourier sums with arbitrary real frequencies and no separation assumption. For every $g(t)=\sum_{j=1}^k v_je^{iλ_jt}$ with $λ_j\in\mathbb{R}$ and every $x\geq 1$, \begin{align*} |g(x)|\le k\exp(O(k\operatorname{arcosh} x))\|g\|_{L^2[-1,1]}. \end{align*} Near the endpoint at $x=1+δ$, this gives an exponential factor of $\exp(O(k\sqrtδ))$, improving on the $\exp(O(k^2\log k\cdotδ))$ estimate of Chen and Price (ICALP 2019), and the exponent is optimal up to a constant factor. Our theorem has algorithmic applications to recovering gapless Fourier-sparse signals: it improves the resolution of cluster-location algorithms and the sample complexity of Fourier interpolation algorithms. In addition, it gives sharp bounds on the error transfer of sparse Fourier models just outside the training interval.

cs.DS↗
arXiv2026

Stochastic Network Speed Scaling with Competitive Ratios Independent of the Network

In network speed scaling, jobs arrive over time at a network of servers whose speeds can be tuned, every job must be processed by the servers along one of its allowed routes, and the goal is to minimize the total flow time plus the total energy. For stochastic arrivals, the competitive ratio of Vaze and Nair depends on the network, through the lengths of the routes it uses. We show that this dependence can be removed: we give an algorithm, which routes the jobs by solving a convex program and runs every server at a fixed speed, whose competitive ratio depends only on the power functions; for $P(s)=s^2$, it is at most the golden ratio $φ\approx1.618$. The key idea is a lower bound on the optimal cost which, like the cost of our algorithm, is a sum over the servers of a function of each server's load, so the analysis reduces to a single server. We also show that the routing rule of Vaze and Nair can be a factor $Ω(L)$ away from optimal, where $L$ is the length of the longest route.

cs.DS↗