Deterministic Algorithms for Solving Boolean Polynomial Equations Based on Channel Coding Theory

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

View graph of relations

Author(s)

  • Guangfu WU
  • Yijie LV
  • Daojing HE
  • Jiguang HE
  • Huan ZHOU

Related Research Unit(s)

Detail(s)

Original languageEnglish
Article number8979348
Pages (from-to)26764-26772
Journal / PublicationIEEE Access
Volume8
Online published3 Feb 2020
Publication statusPublished - 2020

Link(s)

Abstract

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 Gröbner 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.

Research Area(s)

  • Boolean polynomial equations, Channel coding theory, Deterministic, Non-algebraic, Robust

Citation Format(s)

Deterministic Algorithms for Solving Boolean Polynomial Equations Based on Channel Coding Theory. / WU, Guangfu; LV, Yijie; HE, Daojing; HE, Jiguang; ZHOU, Huan; CHAN, Sammy.

In: IEEE Access, Vol. 8, 8979348, 2020, p. 26764-26772.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

Download Statistics

No data available