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 条

[41] Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes
Das, Bireswar
Sharma, Shivdutt
THEORY OF COMPUTING SYSTEMS, 2021, 65 (03) : 497 - 514
[42] Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity
Franck M.
Yingchareonthawornchai S.
ACM Journal of Experimental Algorithmics, 2022, 27 (01):
[43] Solving the 2-Disjoint Paths Problem in Nearly Linear Time
Torsten Tholey
Theory of Computing Systems, 2006, 39 : 51 - 78
[44] On stubborn sets in the verification of linear time temporal properties
Varpaaniemi, K
APPLICATION AND THEORY OF PETRI NETS 1998, 1998, 1420 : 124 - 143
[45] Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time
Wang, Mengdi
MATHEMATICS OF OPERATIONS RESEARCH, 2020, 45 (02) : 517 - 546
[46] Clustering huge protein sequence sets in linear time
Martin Steinegger
Johannes Söding
Nature Communications, 9
[47] On stubborn sets in the verification of linear time temporal properties
Varpaaniemi, K
FORMAL METHODS IN SYSTEM DESIGN, 2005, 26 (01) : 45 - 67
[48] NEW CLASSES OF NEARLY OPTIMAL TIME-HOPPING SEQUENCE SETS FOR UWB SYSTEMS
Li, Peihua
Zheng, Xingyu
Fan, Cuiling
ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2024, 18 (06) : 1733 - 1747
[49] On Stubborn Sets in the Verification of Linear Time Temporal Properties
Kimmo Varpaaniemi
Formal Methods in System Design, 2005, 26 : 45 - 67
[50] Clustering huge protein sequence sets in linear time
Steinegger, Martin
Soeding, Johannes
NATURE COMMUNICATIONS, 2018, 9

← 1 2 3 4 5 →