Pages that link to "Item:Q2435409"
From MaRDI portal
The following pages link to On the complexity of Boolean matrix ranks (Q2435409):
Displaying 13 items.
- Rank functions of tropical matrices (Q269280) (← links)
- A bound on the generalized competition index of a primitive matrix using Boolean rank (Q551345) (← links)
- On extremal matrices of second largest exponent by Boolean rank (Q869927) (← links)
- Upper bounds on the Boolean rank of Kronecker products (Q2146742) (← links)
- Fooling-sets and rank (Q2346587) (← links)
- The rectangle covering number of random Boolean matrices (Q2363099) (← links)
- Alternating sign matrices, related (0,1)-matrices, and the Smith normal form (Q2418961) (← links)
- The Boolean rank of the uniform intersection matrix and a family of its submatrices (Q2419048) (← links)
- The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions (Q4592948) (← links)
- (Q4957292) (← links)
- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices (Q5041266) (← links)
- Circulant almost cross intersecting families (Q5045251) (← links)
- Approximating the volume of tropical polytopes is difficult (Q5742783) (← links)