.png){kind=icon}
.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Boolean polynomial equations
non-algebraic
channel coding theory
deterministic
robust
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.7W
Citations:
29.4W
Organization
View more organizations