A comparison of two lower bound methods for communication complexity

DOI10.1007/3-540-58338-6_79zbMath1494.68086OpenAlexW2999382554MaRDI QIDQ5096890

Juraj Hromkovič, Martin Dietzfelbinger, Georg Schnitger

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_79

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Communication complexity, information complexity (68Q11)

Cites Work

• On the ratio of optimal integral and fractional covers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A comparison of two lower bound methods for communication complexity