On average case complexity of SAT for symmetric distribution

被引:0
|
作者
机构
来源
J Logic Comput | / 1卷 / 71期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [41] Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity
    Hirahara, Shuichi
    2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 50 - 60
  • [42] On the Complexity of Unique Circuit SAT
    Lialina A.A.
    Journal of Mathematical Sciences, 2020, 247 (3) : 457 - 466
  • [43] Complexity of k-SAT
    Impagliazzo, R
    Paturi, R
    FOURTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1999, : 237 - 240
  • [44] On the complexity of k-SAT
    Impagliazzo, R
    Paturi, R
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 62 (02) : 367 - 375
  • [45] The Complexity of Average-Case Dynamic Subgraph Counting
    Henzinger, Monika
    Lincoln, Andrea
    Saha, Barna
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 459 - 498
  • [47] On the Average-Case Complexity of MCSP and Its Variants
    Hirahara, Shuichi
    Santhanam, Rahul
    32ND COMPUTATIONAL COMPLEXITY CONFERENCE (CCC 2017), 2017, 79
  • [48] Parameterized Average-Case Complexity of the Hypervolume Indicator
    Bringmann, Karl
    Friedrich, Tobias
    GECCO'13: PROCEEDINGS OF THE 2013 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2013, : 575 - 582
  • [49] AVERAGE-CASE COMPLEXITY OF LINEAR MULTIVARIATE PROBLEMS
    WOZNIAKOWSKI, H
    BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1993, 29 (01) : 70 - 76
  • [50] On the average case communication complexity for detection in sensor networks
    Venkatesan, N. E.
    Agarwal, Tarun
    Kumar, P. Vijay
    DISTRIBUTED COMPUTING IN SENSOR SYSTEMS, 2008, 5067 : 176 - 189