Pages that link to "Item:Q1125618"
From MaRDI portal
The following pages link to The linear-array conjecture in communication complexity is false (Q1125618):
Displayed 4 items.
- A counterexample to the Alon-Saks-Seymour conjecture and related problems (Q452825) (← links)
- Ordered biclique partitions and communication complexity problems (Q2342387) (← links)
- Some improved bounds on communication complexity via new decomposition of cliques (Q2636816) (← links)
- Deterministic Communication vs. Partition Number (Q4562279) (← links)