Unique statisfiability of horn sets can be solved in nearly linear time

被引：0
|
作者：
Berman, K.A.
Franco, J.
Schlipf, J.S.
机构：
来源：
Discrete Applied Mathematics | 1995年 / 60卷 / 1-3期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] UNIQUE SATISFIABILITY OF HORN SETS CAN BE SOLVED IN NEARLY LINEAR-TIME
    BERMAN, KA
    FRANCO, J
    SCHLIPF, JS
    DISCRETE APPLIED MATHEMATICS, 1995, 60 (1-3) : 77 - 91
  • [2] A LINEAR-TIME ALGORITHM FOR UNIQUE HORN SATISFIABILITY
    PRETOLANI, D
    INFORMATION PROCESSING LETTERS, 1993, 48 (02) : 61 - 66
  • [3] NEARLY LINEAR TIME
    GUREVICH, Y
    SHELAH, S
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 363 : 108 - 118
  • [4] BIN PACKING CAN BE SOLVED WITHIN 1+ETA IN LINEAR TIME
    DELAVEGA, WF
    LUEKER, GS
    COMBINATORICA, 1981, 1 (04) : 349 - 355
  • [5] Nearly Maximum Flows in Nearly Linear Time
    Sherman, Jonah
    2013 IEEE 54TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2013, : 263 - 269
  • [6] Approximate congruence in nearly linear time
    Indyk, P
    Venkatasubramanian, S
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2003, 24 (02): : 115 - 128
  • [7] Geometric Median in Nearly Linear Time
    Cohen, Michael B.
    Lee, Yin Tat
    Miller, Gary
    Pachocki, Jakub
    Sidford, Aaron
    STOC'16: PROCEEDINGS OF THE 48TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2016, : 9 - 21
  • [8] Approximate congruence in nearly linear time
    Indyk, P
    Venkatasubramanian, S
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 354 - 360
  • [9] Solving Tall Dense Linear Programs in Nearly Linear Time
    van den Brand, Jan
    Lee, Yin Tat
    Sidford, Aaron
    Song, Zhao
    PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), 2020, : 775 - 788
  • [10] Computing absolutely normal numbers in nearly linear time
    Lutz, Jack H.
    Mayordomo, Elvira
    INFORMATION AND COMPUTATION, 2021, 281
12345