Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Dokl. RAN. Math. Inf. Proc. Upr.:
Year:
Volume:
Issue:
Page:
Find




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

Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia, 2024, Volume 518, Pages 35–39
DOI: https://doi.org/10.31857/S2686954324040067 (Mi danma548) 		 
MATHEMATICS

Sufficient condition for polynomial solvability of random 3-CNF formulas

S. I. Uvarov

V. A. Trapeznikov Institute of Control Sciences of Russian Academy of Sciences, Moscow, Russia
Full-text PDF
DOI: https://doi.org/10.31857/S2686954324040067
Abstract: This paper is devoted to the localisation of random 3-CNF formulas that are polynomially solvable by the resolution algorithm. It is shown that random formulas with the number of clauses proportional to the square of the number of variables, are polynomially solvable with probability close to unity when the proportionality coefficient exceeds the found threshold.
Keywords: 3-CNF, clause, resolution, complexity, satisfiability problem.
Presented: S. N. Vassilyev
Received: 22.04.2024
Revised: 11.06.2024
Accepted: 16.07.2024
English version:
Doklady Mathematics, 2024, Volume 110, Issue 1, Pages 323–327
DOI: https://doi.org/10.1134/S1064562424601148
Bibliographic databases:
Document Type: Article
UDC: 510
Language: Russian
Citation: S. I. Uvarov, “Sufficient condition for polynomial solvability of random 3-CNF formulas”, Dokl. RAN. Math. Inf. Proc. Upr., 518 (2024), 35–39; Dokl. Math., 110:1 (2024), 323–327
Citation in format AMSBIB
\Bibitem{Uva24}
\by S.~I.~Uvarov
\paper Sufficient condition for polynomial solvability of random 3-CNF formulas
\jour Dokl. RAN. Math. Inf. Proc. Upr.
\yr 2024
\vol 518
\pages 35--39
\mathnet{http://mi.mathnet.ru/danma548}
\crossref{https://doi.org/10.31857/S2686954324040067}
\elib{https://elibrary.ru/item.asp?id=74176077}
\transl
\jour Dokl. Math.
\yr 2024
\vol 110
\issue 1
\pages 323--327
\crossref{https://doi.org/10.1134/S1064562424601148}
Linking options:
  • https://www.mathnet.ru/eng/danma548
  • https://www.mathnet.ru/eng/danma/v518/p35
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025