An effective molecular algorithm for solving the satisfiability problem

被引：0
|
作者：
Yu, W [1 ]
Zheng, WM [1 ]
机构：
[1] Tsinghua Univ, Dept Comp & Technol, Beijing 100084, Peoples R China
来源：
ADVANCED PARALLEL PROCESSING TECHNOLOGIES, PROCEEDINGS | 2003年 / 2834卷
关键词：
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
A well-defined satisfiability problem (SAT) is mapped into a unique expression of logical array by introducing a transformation. Such an expression forms a unique molecular algorithm for solving SAT, which is prone to computation on an electronic computer. A famous 20-variable instance of the three-satisfiability problem is solved via Matrix laboratory (MATLAB) installed on a notebook computer. The special computation implements huge parallelism that goes beyond I million (2(20)). The unique solution is found and the computational complexity is analyzed.
引用
收藏
页码：274 / 280
页数：7
相关论文
共 50 条
  • [41] A randomized diversification strategy for solving satisfiability problem with long clauses
    Jian GAO
    Ruizhi LI
    Minghao YIN
    Science China(Information Sciences), 2017, 60 (09) : 121 - 131
  • [42] A New Artificial Immune System for Solving the Maximum Satisfiability Problem
    Layeb, Abdesslem
    Deneche, Abdel Hakim
    Meshoul, Souham
    TRENDS IN APPLIED INTELLIGENT SYSTEMS, PT II, PROCEEDINGS, 2010, 6097 : 136 - +
  • [43] Dynamic Analog Circuit Netlisting for Solving the Boolean Satisfiability Problem
    Singh, Sejal
    Namrata, Bhavani
    Hariharan, Venkatnarayan
    10TH INTERNATIONAL CONFERENCE ON ELECTRONICS, COMPUTING AND COMMUNICATION TECHNOLOGIES, CONECCT 2024, 2024,
  • [44] PROBABILISTIC ANALYSIS OF THE DAVIS PUTNAM PROCEDURE FOR SOLVING THE SATISFIABILITY PROBLEM
    FRANCO, J
    PAULL, M
    DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) : 77 - 87
  • [45] Cooperative bees swarm for solving the maximum weighted satisfiability problem
    Drias, H
    Sadeg, S
    Yahi, S
    COMPUTATIONAL INTELLIGENCE AND BIOINSPIRED SYSTEMS, PROCEEDINGS, 2005, 3512 : 318 - 325
  • [46] Solving satisfiability problem by parallel execution of neural networks with biases
    Zhang, KR
    Nagamatu, M
    ARTIFICIAL NEURAL NETWORKS: FORMAL MODELS AND THEIR APPLICATIONS - ICANN 2005, PT 2, PROCEEDINGS, 2005, 3697 : 969 - 974
  • [47] A randomized diversification strategy for solving satisfiability problem with long clauses
    Gao, Jian
    Li, Ruizhi
    Yin, Minghao
    SCIENCE CHINA-INFORMATION SCIENCES, 2017, 60 (09)
  • [48] The Feasibility of Solving the Satisfiability Problem Using Various Machine Learning
    Zhang, Lan
    Hu, Lei
    Yu, Lina
    ENGINEERING LETTERS, 2024, 32 (05) : 1004 - 1011
  • [49] An Effective Guided Fireworks Algorithm for Solving UCAV Path Planning Problem
    Alihodzic, Adis
    Hasic, Damir
    Selmanovic, Elmedin
    NUMERICAL METHODS AND APPLICATIONS, NMA 2018, 2019, 11189 : 29 - 38
  • [50] EFFECTIVE ALGORITHM AND COMPUTATIONAL COMPLEXITY FOR SOLVING SUM OF LINEAR RATIOS PROBLEM
    Jiao, Hongwei
    Ma, Junqiao
    Shen, Peiping
    Qiu, Yongjian
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2023, 19 (06) : 4410 - 4427
12345