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 条
  • [41] A sufficient condition for the super-linearization of polynomial systems
    Belabbas, Mohamed-Ali
    Chen, Xudong
    SYSTEMS & CONTROL LETTERS, 2023, 179
  • [42] A SUFFICIENT CONDITION OF A POLYNOMIAL FISH POPULATION SYSTEM TO BE STABLE
    Louartassi, Younes
    El Mazoudi, El Houssine
    Elalami, Noureddine
    INTERNATIONAL JOURNAL OF MODELING SIMULATION AND SCIENTIFIC COMPUTING, 2012, 3 (03)
  • [43] Necessary and sufficient condition for the Schur stability of interval polynomial
    Gao, LX
    Sun, ZH
    Xue, AK
    Sun, YX
    2002 IEEE REGION 10 CONFERENCE ON COMPUTERS, COMMUNICATIONS, CONTROL AND POWER ENGINEERING, VOLS I-III, PROCEEDINGS, 2002, : 1318 - 1322
  • [44] ON THE DIAMETER OF THE SET OF SATISFYING ASSIGNMENTS IN RANDOM SATISFIABLE k-CNF FORMULAS
    Feige, Uriel
    Flaxman, Abraham D.
    Vilenchik, Dan
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, 25 (02) : 736 - 749
  • [45] SUFFICIENT CONDITION FOR SOLVABILITY IN GROUPS ADMITTING ELEMENTARY ABELIAN OPERATOR GROUPS
    PETTET, MR
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 23 (06): : A568 - A568
  • [46] A Necessary and Sufficient Condition for the Solvability of the Nonlinear Schrodinger Equation on a Finite Interval
    Li, Ruo-meng
    Geng, Xian-guo
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2021, 37 (01): : 75 - 100
  • [47] SUFFICIENT CONDITION FOR SOLVABILITY IN GROUPS ADMITTING ELEMENTARY ABELIAN OPERATOR GROUPS
    PETTET, MR
    CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1977, 29 (04): : 848 - 855
  • [48] A SUFFICIENT CONDITION FOR BIFURCATION IN RANDOM DYNAMICAL SYSTEMS
    Chen, Xiaopeng
    Duan, Jinqiao
    Fu, Xinchu
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2010, 138 (03) : 965 - 973
  • [49] ON A CONDITION NUMBER OF GENERAL RANDOM POLYNOMIAL SYSTEMS
    Nguyen, Hoi H.
    MATHEMATICS OF COMPUTATION, 2016, 85 (298) : 737 - 757
  • [50] Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas
    Doerr, Benjamin
    Neumann, Frank
    Sutton, Andrew M.
    ALGORITHMICA, 2017, 78 (02) : 561 - 586
12345