Pages that link to "Item:Q1970502"
From MaRDI portal
The following pages link to Matrix rank and communication complexity (Q1970502):
Displaying 5 items.
- Linear algebraic methods in communication complexity (Q417541) (← links)
- The minimum semidefinite rank of a triangle-free graph (Q630548) (← links)
- On the complexity of decomposing matrices arising in satellite communication (Q1060960) (← links)
- Still another rank determination of set intersection matrices with an application in communication complexity (Q1324468) (← links)
- Extremal problems under dimension constraints. (Q1417564) (← links)