The number of k-SAT functions

被引：5
|
作者：
Bollobás, B
Brightwell, GR [1 ]
机构：
[1] Univ Memphis, Dept Math Sci, Memphis, TN 38152 USA
[2] Univ Cambridge Trinity Coll, Cambridge CB2 1TQ, England
[3] Univ London London Sch Econ & Polit Sci, Dept Math, London WC2A 2AE, England
来源：
RANDOM STRUCTURES & ALGORITHMS | 2003年 / 22卷 / 03期
关键词：
D O I：
10.1002/rsa.10079
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We study the number SAT(k; n) of Boolean functions of n variables that can be expressed by a k-SAT formula. Equivalently, we study the number of subsets of the n-cube 2(n) that can be represented as the union of (n - k)-subcubes. In The number of 2-SAT functions (Isr J Math, 133 (2003), 45-60) the authors and Imre Leader studied SAT(k; n) for k less than or equal to n/2, with emphasis on the case k = 2. Here, we prove bounds on SAT(k; n) for k greater than or equal to n/2; we see a variety of different types of behavior. (C) 2003 Wiley Periodicals, Inc.
引用
收藏
页码：227 / 247
页数：21
相关论文
共 50 条
  • [11] The Asymptotic k-SAT Threshold
    Coja-Oghlan, Amin
    STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2014, : 804 - 813
  • [12] Approximating MIN k-SAT
    Avidor, A
    Zwick, U
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002, 2518 : 465 - 475
  • [13] Biased random k-SAT
    Larsson, Joel
    Markstrom, Klas
    RANDOM STRUCTURES & ALGORITHMS, 2021, 59 (02) : 238 - 266
  • [14] Some results for k-SAT on trees
    Sumedha
    Krishnamurthy, Supriya
    STATPHYS-KOLKATA VIII, 2015, 638
  • [15] On an online random k-SAT model
    Kravitz, David
    RANDOM STRUCTURES & ALGORITHMS, 2008, 32 (01) : 115 - 124
  • [16] On the behaviour of random K-SAT on trees
    Krishnamurthy, Supriya
    Sumedha
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2012,
  • [17] k-SAT Is No Harder Than Decision-Unique-k-SAT
    Calabro, Chris
    Paturi, Ramamohan
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2009, 5675 : 59 - 70
  • [18] Hardness of Approximation Algorithms on k-SAT and (k,s)-SAT Problems
    Deng, Tianyan
    Xu, Daoyun
    PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE FOR YOUNG COMPUTER SCIENTISTS, VOLS 1-5, 2008, : 60 - 64
  • [19] The Decimation Process in Random k-SAT
    Coja-Oghlan, Amin
    Pachon-Pinzon, Angelica Y.
    Automata, Languages and Programming, ICALP, Pt I, 2011, 6755 : 305 - 316
  • [20] THE DECIMATION PROCESS IN RANDOM k-SAT
    Coja-Oghlan, Amin
    Pachon-Pinzon, Angelica Y.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (04) : 1471 - 1509
12345