|
This article is cited in 1 scientific paper (total in 1 paper)
On complexity of boolean matrix polynomials solving
F. B. Burtyka Southern Federal University, Rostov-on-Don
Abstract:
The paper investigates the problems of Boolean matrix polynomials solving and evaluating the number of the solvents. A method for matrix polynomial roots finding via solving the system of Boolean algebraic equations and well-known NP-complete problem “Satisfiability” is proposed. A comparison of techniques for solving Boolean matrix polynomials is provided. The paper shows results of computer experiments.
Keywords:
matrix polynomials, Boolean polynomials, Boolean Gröbner base, system of Boolean algebraic equations, SAT-solver.
Received: 30.03.2015
Citation:
F. B. Burtyka, “On complexity of boolean matrix polynomials solving”, Mat. Model., 27:7 (2015), 25–30
Linking options:
https://www.mathnet.ru/eng/mm3618 https://www.mathnet.ru/eng/mm/v27/i7/p25
|
|