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 条
  • [31] Simulation DNA Algorithm Model of Satisfiability Problem
    Zhou, Kang
    Fan, Lili
    Shao, Kai
    Dong, Wenbo
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (07) : 1220 - 1227
  • [32] An effective heuristic algorithm for the maximum satisfiability problem
    Mohamed El Bachir Menaï
    Mohamed Batouche
    Applied Intelligence, 2006, 24 : 227 - 239
  • [33] An algorithm based on tabu search for satisfiability problem
    Huang, WQ
    Zhang, DF
    Wang, HX
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2002, 17 (03) : 340 - 346
  • [34] An algorithm based on tabu search for satisfiability problem
    Wenqi Huang
    Defu Zhang
    Houxiang Wang
    Journal of Computer Science and Technology, 2002, 17 : 340 - 346
  • [35] Evolutionary local search algorithm for the satisfiability problem
    Aksoy, Levent
    Gunes, Ece Olcay
    ARTIFICIAL INTELLIGENCE AND NEURAL NETWORKS, 2006, 3949 : 185 - 193
  • [36] An effective heuristic algorithm for the maximum satisfiability problem
    Menaï, ME
    Batouche, M
    APPLIED INTELLIGENCE, 2006, 24 (03) : 227 - 239
  • [37] An effective molecular algorithm for solving the satisfiability problem
    Yu, W
    Zheng, WM
    ADVANCED PARALLEL PROCESSING TECHNOLOGIES, PROCEEDINGS, 2003, 2834 : 274 - 280
  • [38] A Refined Branching Algorithm for the Maximum Satisfiability Problem
    Li, Wenjun
    Xu, Chao
    Yang, Yongjie
    Chen, Jianer
    Wang, Jianxin
    ALGORITHMICA, 2022, 84 (04) : 982 - 1006
  • [39] AN EFFICIENT ALGORITHM FOR THE 3-SATISFIABILITY PROBLEM
    BILLIONNET, A
    SUTTER, A
    OPERATIONS RESEARCH LETTERS, 1992, 12 (01) : 29 - 36
  • [40] A linear time algorithm for a matching problem on the circle
    Cabrelli, CA
    Molter, UM
    INFORMATION PROCESSING LETTERS, 1998, 66 (03) : 161 - 164
12345