Geodesic
Satisfiability in Boolean logic (SAT problem) is polynomial
Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika, Tome 14 (2021) no. 5, pp. 667-671

Voir la notice de l'article provenant de la source Math-Net.Ru

We find a polynomial algorithm to solve SAT problem in Boolean Logic.
Keywords: Boolean logic, satisfiability problem, SAT algorithm. 
@article{JSFU_2021_14_5_a14,
     author = {Vladimir V. Rybakov},
     title = {Satisfiability in {Boolean} logic {(SAT} problem) is polynomial},
     journal = {\v{Z}urnal Sibirskogo federalʹnogo universiteta. Matematika i fizika},
     pages = {667--671},
     publisher = {mathdoc},
     volume = {14},
     number = {5},
     year = {2021},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/JSFU_2021_14_5_a14/}
}
TY  - JOUR
AU  - Vladimir V. Rybakov
TI  - Satisfiability in Boolean logic (SAT problem) is polynomial
JO  - Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika
PY  - 2021
SP  - 667
EP  - 671
VL  - 14
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/JSFU_2021_14_5_a14/
LA  - en
ID  - JSFU_2021_14_5_a14
ER  - 
%0 Journal Article
%A Vladimir V. Rybakov
%T Satisfiability in Boolean logic (SAT problem) is polynomial
%J Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika
%D 2021
%P 667-671
%V 14
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/JSFU_2021_14_5_a14/
%G en
%F JSFU_2021_14_5_a14
Vladimir V. Rybakov. Satisfiability in Boolean logic (SAT problem) is polynomial. Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika, Tome 14 (2021) no. 5, pp. 667-671. http://geodesic.mathdoc.fr/item/JSFU_2021_14_5_a14/