Sufficient Condition for Polynomial Solvability of Random 3-CNF Formulas

被引：0
|
作者：
Uvarov, S., I [1 ]
机构：
[1] Russian Acad Sci, V A Trapeznikov Inst Control Sci, Moscow, Russia
来源：
DOKLADY MATHEMATICS | 2024年 / 110卷 / 01期
关键词：
3-CNF; clause; resolution; complexity; satisfiability problem; SATISFIABILITY;
D O I：
10.1134/S1064562424601148
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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.
引用
收藏
页码：323 / 327
页数：5
相关论文
共 50 条
  • [1] An Improved Generator for 3-CNF Formulas
    S. I. Uvarov
    Automation and Remote Control, 2020, 81 : 130 - 138
  • [2] An Improved Generator for 3-CNF Formulas
    Uvarov, S., I
    AUTOMATION AND REMOTE CONTROL, 2020, 81 (01) : 130 - 138
  • [3] Definability on a random 3-CNF formula
    Atserias, A
    LICS 2005: 20TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE - PROCEEDINGS, 2005, : 458 - 466
  • [4] Runtime Analysis of the (1+(λ,λ)) Genetic Algorithm on Random Satisfiable 3-CNF Formulas
    Buzdalov, Maxim
    Doerr, Benjamin
    PROCEEDINGS OF THE 2017 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'17), 2017, : 1343 - 1350
  • [5] Solving Random Satisfiable 3CNF Formulas in Expected Polynomial Time
    Krivelevich, Michael
    Vilenchik, Dan
    PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 454 - +
  • [6] Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation
    Doerr, Benjamin
    Neumann, Frank
    Sutton, Andrew M.
    GECCO'15: PROCEEDINGS OF THE 2015 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2015, : 1415 - 1422
  • [7] A sufficient condition for solvability
    Dencker, N
    INTERNATIONAL MATHEMATICS RESEARCH NOTICES, 1999, 1999 (12) : 627 - 659
  • [8] Runtime analysis of evolutionary algorithms on randomly constructed high-density satisfiable 3-CNF formulas
    1600, Springer Verlag (8672):
  • [9] Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas
    Sutton, Andrew M.
    Neumann, Frank
    PARALLEL PROBLEM SOLVING FROM NATURE - PPSN XIII, 2014, 8672 : 942 - 951
  • [10] COUNTING SOLUTIONS TO RANDOM CNF FORMULAS
    Galanis, Andreas
    Goldberg, Leslie Ann
    Guo, Heng
    Yang, Kuan
    SIAM JOURNAL ON COMPUTING, 2021, 50 (06) : 1701 - 1738
12345