Pages that link to "Item:Q5285941"
From MaRDI portal
The following pages link to Communication Complexity and Quasi Randomness (Q5285941):
Displaying 14 items.
- Hellinger volume and number-on-the-forehead communication complexity (Q295642) (← links)
- Hadamard tensors and lower bounds on multiparty communication complexity (Q371197) (← links)
- On a theorem of Razborov (Q445247) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- The communication complexity of addition (Q519955) (← links)
- One-way multiparty communication lower bound for pointer jumping with applications (Q532058) (← links)
- Quasi-random subsets of \(\mathbb{Z}_ n\) (Q1194750) (← links)
- Hypergraphs, quasi-randomness, and conditions for regularity (Q1604564) (← links)
- Some applications of hypercontractive inequalities in quantum information theory (Q2872466) (← links)
- Quasi-random hypergraphs revisited (Q3119043) (← links)
- Interleaved Group Products (Q4634030) (← links)
- (Q5005112) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- Quasi-random Boolean functions (Q6574391) (← links)
