The following pages link to (Q5111164):
Displaying 6 items.
- Still another rank determination of set intersection matrices with an application in communication complexity (Q1324468) (← links)
- Constructive non-commutative rank computation is in deterministic polynomial time (Q1630376) (← links)
- An exponential lower bound for the degrees of invariants of cubic forms and tensor actions (Q2180892) (← links)
- Operator scaling: theory and applications (Q2309517) (← links)
- A deterministic PTAS for the commutative rank of matrix spaces (Q4568108) (← links)
- (Q5090466) (← links)
