scientific article; zbMATH DE number 1256713

MaRDI QIDQ4228448zbMATH OpenFDO

Authors Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky

Publication date 18 May 1999

zbMATH Keywords

linear array networkTiwari's conjecture

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• The linear-array conjecture in communication complexity is false
• scientific article; zbMATH DE number 1559553
• Probabilistic communication complexity

Cited in

(6)

• The linear-array conjecture in communication complexity is false
• Exact communication costs for consensus and leader in a tree
• scientific article; zbMATH DE number 1559553 (Why is no real title available?)
• The Log-Approximate-Rank Conjecture Is False
• The communication complexity of enumeration, elimination, and selection
• The lazy adversary conjecture fails

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228448)