Journal of Siberian Federal University. Mathematics & Physics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


J. Sib. Fed. Univ. Math. Phys.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Journal of Siberian Federal University. Mathematics & Physics, 2021, Volume 14, Issue 5, Pages 667–671
DOI: https://doi.org/10.17516/1997-1397-2021-14-5-667-671 (Mi jsfu953) 		 
Satisfiability in Boolean logic (SAT problem) is polynomial

Vladimir V. Rybakovab

a Siberian Federal University, Krasnoyarsk, Russian Federation
b A. P. Ershov Institute of Informatics Systems, Novosibirsk, Russian Federation
Full-text PDF (92 kB)
References:
PDF
HTML
DOI: https://doi.org/10.17516/1997-1397-2021-14-5-667-671
Abstract: We find a polynomial algorithm to solve SAT problem in Boolean Logic.
Keywords: Boolean logic, satisfiability problem, SAT algorithm.
Funding agency Grant number
Ministry of Science and Higher Education of the Russian Federation 075-02-2020-1534/1
National Research University Higher School of Economics
This research is supported by High Schools of Economics (HSE) Moscow; supported by the Krasnoyarsk Mathematical Center and financed by the Ministry of Science and Higher Education of the Russian Federation (Grant No. 075-02-2020-1534/1).
Received: 10.07.2021
Received in revised form: 10.08.2021
Accepted: 21.08.2021
Bibliographic databases:
Document Type: Article
UDC: 512.54
Language: English
Citation: Vladimir V. Rybakov, “Satisfiability in Boolean logic (SAT problem) is polynomial”, J. Sib. Fed. Univ. Math. Phys., 14:5 (2021), 667–671
Citation in format AMSBIB
\Bibitem{Ryb21}
\by Vladimir~V.~Rybakov
\paper Satisfiability in Boolean logic (SAT problem) is polynomial
\jour J. Sib. Fed. Univ. Math. Phys.
\yr 2021
\vol 14
\issue 5
\pages 667--671
\mathnet{http://mi.mathnet.ru/jsfu953}
\crossref{https://doi.org/10.17516/1997-1397-2021-14-5-667-671}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000716998700014}
Linking options:
  • https://www.mathnet.ru/eng/jsfu953
  • https://www.mathnet.ru/eng/jsfu/v14/i5/p667
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Журнал Сибирского федерального университета. Серия "Математика и физика"
    Statistics & downloads:
    Abstract page:135
    Full-text PDF :50
    References:28
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025