Pages that link to "Item:Q1365681"
From MaRDI portal
The following pages link to Geometric arguments yield better bounds for threshold circuits and distributed computing (Q1365681):
Displayed 8 items.
- Extended formulations, nonnegative factorizations, and randomized communication protocols (Q745681) (← links)
- A linear lower bound on the unbounded error probabilistic communication complexity. (Q1872728) (← links)
- On relations between counting communication complexity classes (Q1880784) (← links)
- Upper bounds on communication in terms of approximate rank (Q2117081) (← links)
- Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
- Fooling Pairs in Randomized Communication Complexity (Q2835016) (← links)
- Quantum State Complexity of Formal Languages (Q5500700) (← links)
- Around the log-rank conjecture (Q6050267) (← links)