On complexity of Boolean matrix polynomials solving

MaRDI QIDQ2788899zbMATH OpenFDO

Authors F. B. Burtyka

Publication date 22 February 2016

Published in Matematicheskoe Modelirovanie (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/mm3618

zbMATH Keywords

Boolean functionsBoolean matricesmatrix exponential functionsspecial polynomials

Mathematics Subject Classification ID

Boolean functions (06E30) Special polynomials in general fields (12E10) Matrix exponential and similar functions of matrices (15A16) Boolean and Hadamard matrices (15B34)

Review text

The problem of estimating roots of Boolean matrix polynomials and their determination is not a trivial task for researchers. Here, the method of finding roots by reducing the equations to Boolean algebraic equations is proposed. Numerical experiments are realized and discussed.

Recommendations

• scientific article; zbMATH DE number 2227342
• The complexity of Boolean matrix root computation
• The complexity of Boolean matrix root computation
• Remark on Algorithms to Find Roots of Polynomials
• On the number of roots of Boolean polynomials

Cited in

(8)

• The complexity of Boolean matrix root computation
• Boolean matrices and their applications to covering reductions
• A Note on Deterministic Poly-Time Algorithms for Partition Functions Associated with Boolean Matrices with Prescribed Row and Column Sums
• The complexity of Boolean matrix root computation
• scientific article; zbMATH DE number 8033 (Why is no real title available?)
• Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices
• scientific article; zbMATH DE number 279581 (Why is no real title available?)
• Matrix approach to solve polynomial equations

This page was built for publication: On complexity of Boolean matrix polynomials solving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2788899)