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  -