Pages that link to "Item:Q1344621"
From MaRDI portal
The following pages link to Some combinatorial-algebraic problems from complexity theory (Q1344621):
Displaying 10 items.
- On a theorem of Razborov (Q445247) (← links)
- Complexity measures of sign matrices (Q949752) (← links)
- Rigidity of a simple extended lower triangular matrix (Q963424) (← links)
- Entropy of operators or why matrix multiplication is hard for depth-two circuits (Q970107) (← links)
- Representing \((0,1)\)-matrices by Boolean circuits (Q1045160) (← links)
- Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity (Q1604200) (← links)
- Matrix rigidity (Q1970501) (← links)
- Dimension-free bounds and structural results in communication complexity (Q2698435) (← links)
- Comparison of matrix norm sparsification (Q6066776) (← links)
- On Blocky Ranks Of Matrices (Q6489336) (← links)
