AN O(N-2) ALGORITHM FOR THE SATISFIABILITY PROBLEM OF A SUBSET OF PROPOSITIONAL SENTENCES IN CNF THAT INCLUDES ALL HORN SENTENCES

被引：8

|

作者：

ARVIND, V

BISWAS, S

机构：

来源：

INFORMATION PROCESSING LETTERS | 1987年 / 24卷 / 01期

关键词：

D O I：

10.1016/0020-0190(87)90200-6

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：67 / 69

页数：3

相关论文

共 4 条

[1] A simple O(n(2)) algorithm for the all-pairs shortest path problem on an interval graph
Mirchandani, P
[J]. NETWORKS, 1996, 27 (03) : 215 - 217
[2] A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n2 log n) Expected Time
Takaoka, Tadao
Hashim, Mashitoh
[J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT II, 2010, 6509 : 195 - 206
[3] A simplified algorithm for the all pairs shortest path problem with O(n2 log n) expected time
Takaoka, Tadao
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 25 (02) : 326 - 337
[4] A simplified algorithm for the all pairs shortest path problem with O(n2logn) expected time
Tadao Takaoka
[J]. Journal of Combinatorial Optimization, 2013, 25 : 326 - 337