Satisfiability in Boolean logic (SAT problem) is polynomial

Vladimir V. Rybakov<sup>ab

a</sup> Siberian Federal University, Krasnoyarsk, Russian Federation
^b A. P. Ershov Institute of Informatics Systems, Novosibirsk, Russian Federation

Abstract: We find a polynomial algorithm to solve SAT problem in Boolean Logic.

Keywords: Boolean logic, satisfiability problem, SAT algorithm.

UDC: 512.54

Received: 10.07.2021
Received in revised form: 10.08.2021
Accepted: 21.08.2021

Language: English

DOI: 10.17516/1997-1397-2021-14-5-667-671

Bibliographic databases:

•