Pages that link to "Item:Q1884841"
From MaRDI portal
The following pages link to The complexity of Boolean matrix root computation (Q1884841):
Displaying 7 items.
- Notes on logics of metric spaces (Q878157) (← links)
- A constraint optimization approach to causal discovery from subsampled time series data (Q1678425) (← links)
- Combination of roots and Boolean operations: an application to state complexity (Q2105451) (← links)
- Matrix roots in the max-plus algebra (Q2238858) (← links)
- On complexity of Boolean matrix polynomials solving (Q2788899) (← links)
- Some properties of square roots for a Boolean matrix (Q4901192) (← links)
- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices (Q5041266) (← links)