Pages that link to "Item:Q4967160"
From MaRDI portal
The following pages link to Recent advances on the log-rank conjecture in communication complexity (Q4967160):
Displaying 9 items.
- The corruption bound, log-rank, and communication complexity (Q1621501) (← links)
- Extended formulations for matroid polytopes through randomized protocols (Q2670489) (← links)
- On the binary and Boolean rank of regular matrices (Q2689370) (← links)
- Dimension-free bounds and structural results in communication complexity (Q2698435) (← links)
- On Vertices and Facets of Combinatorial 2-Level Polytopes (Q2835675) (← links)
- Deterministic Communication vs. Partition Number (Q4562279) (← links)
- (Q5092448) (← links)
- (Q5121896) (← links)
- Approximate F_2-Sketching of Valuation Functions (Q5875529) (← links)