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 条
  • [31] Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes
    Das, Bireswar
    Sharma, Shivdutt
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2019, 11532 : 80 - 92
  • [32] A Nearly Linear Time Algorithm For The Half Integral Disjoint Paths Packing
    Kawarabayashi, Ken-ichi
    Reed, Bruce
    PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2008, : 446 - +
  • [33] Solving the 2-disjoint paths problem in nearly linear time
    Tholey, T
    STACS 2004, PROCEEDINGS, 2004, 2996 : 350 - 361
  • [34] Semi-Random Sparse Recovery in Nearly-Linear Time
    Kelner, Jonathan A.
    Li, Jerry
    Liu, Allen
    Sidford, Aaron
    Tian, Kevin
    THIRTY SIXTH ANNUAL CONFERENCE ON LEARNING THEORY, VOL 195, 2023, 195
  • [35] A Nearly-Linear Time Framework for Graph-Structured Sparsity
    Hegde, Chinmay
    Indyk, Piotr
    Schmidt, Ludwig
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 37, 2015, 37 : 928 - 937
  • [36] A characterization and nearly linear-time equivalence test forμ-branching programs
    V. Raghavan
    D. Wilkins
    Theory of Computing Systems, 1997, 30 (3) : 249 - 283
  • [37] Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs
    van den Brand, Jan
    Lee, Yin-Tat
    Nanongkai, Danupon
    Peng, Richard
    Saranurak, Thatchaphol
    Sidford, Aaron
    Song, Zhao
    Wang, Di
    2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 919 - 930
  • [38] Interlaced Greedy Algorithm for Maximization of Submodular Functions in Nearly Linear Time
    Kuhnle, Alan
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
  • [39] Nearly Linear-Time Model-Based Compressive Sensing
    Hegde, Chinmay
    Indyk, Piotr
    Schmidt, Ludwig
    AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT I, 2014, 8572 : 588 - 599
  • [40] Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes
    Bireswar Das
    Shivdutt Sharma
    Theory of Computing Systems, 2021, 65 : 497 - 514
12345