Pages that link to "Item:Q3178295"
From MaRDI portal
The following pages link to Communication Complexity (for Algorithm Designers) (Q3178295):
Displayed 9 items.
- Disjointness through the lens of Vapnik-Chervonenkis dimension: sparsity and beyond (Q2159471) (← links)
- Extension complexity of the correlation polytope (Q2294265) (← links)
- Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract) (Q2988848) (← links)
- Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
- (Q5009504) (← links)
- The Communication Complexity of Set Intersection and Multiple Equality Testing (Q5858651) (← links)
- A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games (Q6055559) (← links)
- Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond (Q6062144) (← links)
- Space limited linear-time graph algorithms on big data (Q6196840) (← links)