Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2310.19833

Polynomial Time Algorithm for Boolean Satisfiability Problem

Stepan G. Margaryan
View original source ↗Read source document ↗Export metadata ↓

Abstract

This is the latest in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. In the previous papers, we have proved that the sat CNF problem is polynomially reduced to the problem of finding a special covering for a set under the special decomposition of this set and vice versa. That is, these problems are polinomially equivalent. This means that the problem of finding a special covering for a set under a special decomposition of this set, is an NP-complete problem. We also described algorithmic procedures that determine whether there is a special covering for a set under a special decomposition of this set. In this article we prove that all these algorithmic procedures have polynomial time complexity with respect to the length of input data. In addition, we will describe an algorithm that, given any Boolean function in conjunctive normal form (CNF), determines in polynomial time whether this function is satisfiable. We will prove that the time complexity of this algorithm is bounded by the cube of the length of the input data. Also, if the function is not satisfiable, the algorithm deduces this result noting the reason for this result. We have implemented an algorithm in Python, and successfully tested it on Boolean functions represented in CNF with tens of thousands of variables and tens of thousands of clauses.

Explore related subjects

cs.CC

Keep this discovery

BibTeXRIS

Stepan G. Margaryan. 2023-10-28. Polynomial Time Algorithm for Boolean Satisfiability Problem. https://arxiv.org/abs/2310.19833

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

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗