On complexity of boolean matrix polynomials solving

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.