Pages that link to "Item:Q1604200"
From MaRDI portal
The following pages link to Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity (Q1604200):
Displaying 13 items.
- Complexity of linear circuits and geometry (Q300885) (← links)
- Kolmogorov width of discrete linear spaces: an approach to matrix rigidity (Q301519) (← links)
- Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
- A variational approach of the rank function (Q356507) (← links)
- More on average case vs approximation complexity (Q430823) (← links)
- On a theorem of Razborov (Q445247) (← links)
- Using elimination theory to construct rigid matrices (Q475335) (← links)
- Min-rank conjecture for log-depth circuits (Q657911) (← links)
- Shadows and intersections: Stability and new proofs (Q932174) (← links)
- Rigidity of a simple extended lower triangular matrix (Q963424) (← links)
- The landscape of communication complexity classes (Q1653337) (← links)
- Placing conditional disclosure of secrets in the communication complexity universe (Q2035998) (← links)
- The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
