Abstract. Systems of many Boolean equations with many variables are regarded, which have a lot of practical applications in logic design and diagnostics, pattern recognition, artificial intelligence, etc. A special attention is paid to systems of linear equations playing an important role in information security problems. A compact matrix representation is suggested for such systems. A series of original methods and algorithms for their solution is surveyed in this paper, as well as the information concerning their program implementation and experimental estimation of their efficiency.

Keywords: Solving Boolean equations, large systems, combinatorial search

ACM Classification Keywords: G.2.1 Combinatorics. I.2.8. Problem solving, G.3 Probability and Statistics

Link:

SOLVING LARGE SYSTEMS OF BOOLEAN EQUATIONS

Arkadij Zakrevskij

http://foibg.com/ijita/vol16/IJITA16-1-p02.pdf