The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection

DOI10.1109/FOCS.2009.15MaRDI QIDQ5171164zbMATH OpenOpenAlexFDO

Authors Eyal Kushilevitz, Enav Weinreb

Publication date 25 July 2014

Published in 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/focs.2009.15

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited in

(3)

• Exponential lower bounds for polytopes in combinatorial optimization
• Certifying equality with limited interaction
• scientific article; zbMATH DE number 7650118 (Why is no real title available?)

This page was built for publication: The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection

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