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 条

[21] A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs
Koufogiannakis, Christos
Young, Neal E.
ALGORITHMICA, 2014, 70 (04) : 648 - 674
[22] A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs
Christos Koufogiannakis
Neal E. Young
Algorithmica, 2014, 70 : 648 - 674
[23] NEARLY LINEAR TIME ALGORITHMS FOR PRECONDITIONING AND SOLVING SYMMETRIC, DIAGONALLY DOMINANT LINEAR SYSTEMS
Spielman, Daniel A.
Teng, Shang-Hua
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2014, 35 (03) : 835 - 885
[24] Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time
Brandstädt, A
Mahfud, S
INFORMATION PROCESSING LETTERS, 2002, 84 (05) : 251 - 259
[25] Sample-Optimal Density Estimation in Nearly-Linear Time
Acharya, Jayadev
Diakonikolas, Ilias
Li, Jerry
Schmidt, Ludwig
PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 1278 - 1289
[26] Solving the 2-disjoint paths problem in nearly linear time
Tholey, T
THEORY OF COMPUTING SYSTEMS, 2006, 39 (01) : 51 - 78
[27] Finding Hidden Cliques of Size √N/e in Nearly Linear Time
Deshpande, Yash
Montanari, Andrea
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2015, 15 (04) : 1069 - 1128
[28] Near-Optimal Spanners for General Graphs in (Nearly) Linear Time
Le, Hung
Solomon, Shay
PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 3332 - 3361
[29] A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching
Izumi, Taisuke
Kitamura, Naoki
Yamaguchi, Yutaro
PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 4062 - 4082
[30] A linear time erasure-resilient code with nearly optimal recovery
Alon, N
Luby, M
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (06) : 1732 - 1736

← 1 2 3 4 5 →