A linear time parallel algorithm for the 2-CNF satisfiability problem

被引：0
|
作者：
El-Horbaty, ESM [1 ]
机构：
[1] Qatar Univ, Fac Sci, Dept Comp Sci, Doha, Qatar
来源：
PDPTA'2001: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS | 2001年
关键词：
2-CNF-SAT; parallel algorithms; tree machines; complexity time;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper presents a parallel algorithm for finding a satisfying truth assignment to a given 2-CNF-SAT problem on a tree machine model of computation. The algorithm requires ()(log(2) n) complexity time using a tree machine model of computation with n leaf processing elements.
引用
收藏
页码：761 / 765
页数：5
相关论文
共 50 条
12345