On complexity of Boolean matrix polynomials solving (Q2788899)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On complexity of Boolean matrix polynomials solving |
scientific article; zbMATH DE number 6544216
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On complexity of Boolean matrix polynomials solving |
scientific article; zbMATH DE number 6544216 |
Statements
22 February 2016
0 references
Boolean functions
0 references
Boolean matrices
0 references
matrix exponential functions
0 references
special polynomials
0 references
On complexity of Boolean matrix polynomials solving (English)
0 references
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.
0 references
