scientific article; zbMATH DE number 6292585

zbMATH Open1286.68168MaRDI QIDQ5414555

Thomas P. Hayes

Publication date: 6 May 2014

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2048/0.html

Title of this publication is not available (Why is that?)

zbMATH Keywords

extremal combinatoricscommunication complexityexpander graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• A note on multiparty communication complexity and the Hales-Jewett theorem 👍 👎
• The multiparty communication complexity of set disjointness 👍 👎
• The multiparty communication complexity of set disjointness 👍 👎
• Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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 Q5414555)