Pages that link to "Item:Q2788899"
From MaRDI portal
The following pages link to On complexity of Boolean matrix polynomials solving (Q2788899):
Displaying 6 items.
- The complexity of Boolean matrix root computation (Q1884841) (← links)
- Boolean matrices and their applications to covering reductions (Q2805475) (← links)
- A Note on Deterministic Poly-Time Algorithms for Partition Functions Associated with Boolean Matrices with Prescribed Row and Column Sums (Q2849938) (← links)
- (Q3970833) (← links)
- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices (Q5041266) (← links)
- Matrix approach to solve polynomial equations (Q6165580) (← links)