Journal of Siberian Federal University. Mathematics & Physics: Satisfiability in Boolean Logic (SAT problem) is polynomial?

Journal of Siberian Federal University. Mathematics & Physics / Satisfiability in Boolean Logic (SAT problem) is polynomial?

Issue: Journal of Siberian Federal University. Mathematics & Physics. 2021 14 (5)
Authors: Rybakov, Vladimir V.
Contact information: Rybakov, Vladimir V.: Siberian Federal University Krasnoyarsk, Russian Federation A.P. Ershov Institute of Informatics Systems Novosibirsk, Russian Federation; Vladimir_Rybakov@mail.ru
Keywords: Boolean Logic; Satisfiability Problem; SAT algorithm
Abstract: We find a polynomial algorithm to solve SAT problem in Boolean Logic
Pages: 667–671
DOI: 10.17516/1997-1397-2021-14-5-667-671
Paper at repository of SibFU: https://elib.sfu-kras.ru/handle/2311/143750