.png){kind=icon}
返回
Deterministic Algorithms for Solving Boolean Polynomial Equations Based on Channel Coding Theory
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2971393.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Solving the satisfiability problems of Boolean polynomial equations is still an open challenge in the fields of mathematics and computer science. In this paper, our goal is to propose a non-algebraic method for solving maximal Boolean polynomial equations (Max-PoSSo problem). By leveraging channel coding theory and dynamic programming, we propose three deterministic and robust algorithms for solving the satisfiability problems of Boolean polynomial equations. Comparisons are made among the three proposed algorithms and Genetic and Grobner algorithms. Simulation results show that the proposed algorithms exhibit better performance in terms of the largest number of Boolean polynomials equal to 0 compared to the benchmark schemes in the literature.
Keyword:
Boolean polynomial equations
non-algebraic
channel coding theory
deterministic
robust
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
31.3W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容