Nearly All k-SAT Functions Are Unate

被引:0
|
作者
Balogh, Jozsef [1 ]
Dong, Dingding [2 ]
Lidicky, Bernard [3 ]
Mani, Nitya [4 ]
Zhao, Yufei [4 ]
机构
[1] Univ Illinois, Champaign, IL 61820 USA
[2] Harvard Univ, Cambridge, MA USA
[3] Iowa State Univ, Ames, IA USA
[4] MIT, Cambridge, MA USA
基金
美国国家科学基金会;
关键词
k-SAT function; sum of squares; hypergraph container method; Turan problems; NUMBER;
D O I
10.1145/3564246.3585123
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We prove that 1 - o (1) fraction of all k-SAT functions on n Boolean variables are unate (i.e., monotone after first negating some variables), for any fixed positive integer : and as n -> infinity. This resolves a conjecture by Bollobas, Brightwell, and Leader from 2003. This paper is the second half of a two-part work solving the problem. The first part, by Dong, Mani, and Zhao, reduces the conjecture to a Turan problem on partially directed hypergraphs. In this paper we solve this Turan problem.
引用
收藏
页码:958 / 962
页数:5
相关论文
共 50 条
  • [41] Bounds on Threshold of Regular Random k-SAT
    Rathi, Vishwambhar
    Aurell, Erik
    Rasmussen, Lars
    Skoglund, Mikael
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2010, PROCEEDINGS, 2010, 6175 : 264 - 277
  • [42] On threshold properties of k-SAT:: An additive viewpoint
    Plagne, Alain
    EUROPEAN JOURNAL OF COMBINATORICS, 2006, 27 (07) : 1186 - 1198
  • [43] Strong refutation heuristics for random k-SAT
    Coja-Oghlan, A
    Goerdt, A
    Lanka, A
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, PROCEEDINGS, 2004, 3122 : 310 - 321
  • [44] The asymptotic order of the random k-SAT threshold
    Achlioptas, D
    Moore, C
    FOCS 2002: 43RD ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2002, : 779 - 788
  • [45] On Efficiently Solvable Cases of Quantum k-SAT
    Aldi, Marco
    de Beaudrap, Niel
    Gharibian, Sevag
    Saeedi, Seyran
    COMMUNICATIONS IN MATHEMATICAL PHYSICS, 2021, 381 (01) : 209 - 256
  • [46] Survey and Belief Propagation on random K-SAT
    Braunstein, A
    Zecchina, R
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 : 519 - 528
  • [47] Satisfiability threshold of the skewed random k-SAT
    Sinopalnikov, DA
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2005, 3542 : 263 - 275
  • [48] On the replica symmetric solution of the K-sat model
    Panchenko, Dmitry
    ELECTRONIC JOURNAL OF PROBABILITY, 2014, 19 : 1 - 17
  • [49] Random k-SAT and the power of two choices
    Perkins, Will
    RANDOM STRUCTURES & ALGORITHMS, 2015, 47 (01) : 163 - 173
  • [50] Random k-SAT:: A tight threshold for moderately growing k
    Frieze, A
    Wormald, NC
    COMBINATORICA, 2005, 25 (03) : 297 - 305