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 条
  • [21] A DUAL ALGORITHM FOR THE SATISFIABILITY PROBLEM
    TANAKA, Y
    INFORMATION PROCESSING LETTERS, 1991, 37 (02) : 85 - 89
  • [22] A linear time algorithm for the Hamiltonian path problem on a series-parallel graph
    Wu, QS
    Lee, RCT
    Chao, KM
    PROCEEDINGS OF THE FIFTH JOINT CONFERENCE ON INFORMATION SCIENCES, VOLS 1 AND 2, 2000, : 531 - 534
  • [23] LINEAR-TIME ALGORITHM FOR NETWORK SYNTHESIS PROBLEM IN A SERIES-PARALLEL GRAPH
    HOJATI, M
    UTILITAS MATHEMATICA, 1995, 48 : 97 - 105
  • [24] A NEW ALGORITHM FOR THE PROPOSITIONAL SATISFIABILITY PROBLEM
    GALLO, G
    PRETOLANI, D
    DISCRETE APPLIED MATHEMATICS, 1995, 60 (1-3) : 159 - 179
  • [25] An Algorithm Based on Resolution for the Satisfiability Problem
    Xu, Youjun
    Ouyang, Dantong
    Ye, Yuxin
    2ND IEEE INTERNATIONAL CONFERENCE ON ADVANCED COMPUTER CONTROL (ICACC 2010), VOL. 4, 2010, : 420 - 423
  • [26] Mixed parallel execution of algorithms for satisfiability problem
    Zhang, KR
    Nagamatu, M
    INTELLIGENT INFORMATION PROCESSING II, 2005, 163 : 273 - 277
  • [27] A Parallel Algorithm for Fixed Linear Crossing Number Problem
    Wang, Rong-Long
    Tang, Zheng
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2006, 6 (11): : 59 - 64
  • [28] Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN
    Bubeck, Uwe
    Buening, Hans Kleine
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2010, PROCEEDINGS, 2010, 6175 : 58 - 70
  • [29] A Refined Branching Algorithm for the Maximum Satisfiability Problem
    Wenjun Li
    Chao Xu
    Yongjie Yang
    Jianer Chen
    Jianxin Wang
    Algorithmica, 2022, 84 : 982 - 1006
  • [30] Parallel resolution of the satisfiability problem (SAT) with OpenMP and MPI
    Singer, Daniel
    Vagner, Alain
    PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2006, 3911 : 380 - 388
12345