Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.02047

Short Resolution Refutations for CNFs with Bounded Weighted Incidence Treewidth

Shaowei Cai·Ziqun Li
View original source ↗Read source document ↗Export metadata ↓

Abstract

It is an open problem in proof complexity whether every unsatisfiable CNF formula has an FPT-sized resolution refutation parameterized by incidence treewidth. In this paper, we establish several upper bounds on resolution refutation length related to this problem. Consider an unsatisfiable CNF formula $F$ with $n$ variables, $m$ clauses, maximum clause width $k$, and incidence treewidth $\mathrm{tw}^*(F)$. In this paper, we introduce two variants of incidence treewidth. Their definitions can be stated informally as follows. The first is log-weighted incidence treewidth $\mathrm{tw}_{\log}^*(F)$, which is the treewidth of the weighted incidence graph, in which variables have weight one and each clause has weight equal to the logarithm of its width. The second is partially log-weighted incidence treewidth $\mathrm{tw}^*_{\mathrm{plog}}(F)$, which is a refinement of log-weighted incidence treewidth. In this variant, for a nice tree decomposition of the incidence graph, each clause has weight one along a path selected for that clause and elsewhere has weight equal to the logarithm of one plus the number of its literals whose variables do not appear in any bag on that path, and variables have weight one. For every unsatisfiable CNF formula $F$, we prove the existence of (i) an FPT-sized resolution refutation parameterized by log-weighted incidence treewidth, with width at most $\mathrm{tw}_{\log}^*(F)+k$; (ii) a resolution refutation of length $(n+m)k^{O(\mathrm{tw}^*(F))}$ and width at most $\mathrm{tw}^*(F)+k$; (iii) an FPT-sized resolution refutation parameterized by partially log-weighted incidence treewidth; and (iv) an FPT-sized regular resolution refutation parameterized by log-weighted incidence treewidth. Our main idea is to construct FPT-sized $k$-DNF resolution refutations parameterized by incidence treewidth, and then convert them into resolution refutations.

Explore related subjects

cs.CC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shaowei Cai, Ziqun Li. 2026-10-01. Short Resolution Refutations for CNFs with Bounded Weighted Incidence Treewidth. https://arxiv.org/abs/2610.02047

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

KEEP EXPLORING

Related papers

arXiv2026

Resolution of The Linear-Bounded Automata Question

This paper resolves a famous and longstanding open question in automata theory, i.e., the {\it linear-bounded automata question} (or, for short, the LBA question), which can also be phrased succinctly in the language of computational complexity theory as $${\rm NSPACE}[n]\overset{?}{=}{\rm DSPACE}[n]. $$ In fact, we prove a more general result that $${\rm DSPACE}[S(n)]\subsetneqq {\rm NSPACE}[S(n)], $$where $S(n)\geq n$ is a space-constructible function. Our proof technique is based on diagonalization against deterministic $S(n)$ space-bounded Turing machines by means of a universal nondeterministic Turing machine, together with other novel and interesting new techniques developed in this paper. Our proof also implies the following consequences, which resolve some famous open questions in complexity theory: (1). ${\rm DSPACE}[n]\subsetneqq {\rm NSPACE}[n]$; (2). $L\subsetneqq NL$; (3). $L\subsetneqq P$; (4). There exists no deterministic Turing machine working in $O(\log n)$ space that decides the $st$-connectivity question (STCON).

cs.CC↗
arXiv2026

The Quantumly Fast and the Classically Forrious

We study the extremal Forrelation problem, where, provided with oracle access to Boolean functions $f$ and $g$ promised to satisfy either $\operatorname{forr}(f,g)=1$ or $\operatorname{forr}(f,g)=-1$, one must determine (with high probability) which of the two cases holds while performing as few oracle queries as possible. It is well known that this problem can be solved with one quantum query; yet, Girish and Servedio (ITCS 2026) recently showed this problem requires $\widetildeΩ(2^{n/4})$ classical queries, and conjectured the optimal bound to be $\widetildeΘ(2^{n/2})$. By generalizing their construction, we build on their result and prove a non-adaptive lower bound of $Ω(2^{(1/2- o(1))n})$, which matches the conjectured lower bound up to a vanishing constant in the exponent.

cs.CC↗
arXiv2026

Additional properties of parity based bit-counting complexity classes and hierarchies

We study some properties of the parity based bit-counting complexity classes ${\bf B_{|0| \oplus}P}$ and ${\bf B_{|1| \oplus}P}$. We first prove that both of these complexity classes are closed under complement and ${\bf B_{|1|\oplus}P}\subseteq {\bf B_{|0|\oplus}P}$. We then prove that ${\bf US}\subseteq {\bf P}^{{\bf B_{|1|\oplus}P}}$ and ${\bf US}\subseteq {\bf P}^{{\bf B_{|0|\oplus}P}}$. We then study the class defining characteristic functions of the parity based bit-counting complexity classes, where the one associated with ${\bf B_{|1| \oplus}P}$ produces the Prouhet-Thue-Morse sequence. We then prove that a contiguous block of four values from either sequence determines the parity of its starting index and use this fact to show that ${\bf \oplus P}\subseteq {\bf P}^{{\bf B_{|0|\oplus}P}}$ and ${\bf \oplus P}\subseteq {\bf P}^{{\bf B_{|1|\oplus}P}}$. We then use the parity based bit-counting complexity classes to define various hierarchies and show that they all contain ${\bf PH}$ and are contained in ${\bf CH}$.

cs.CC↗