Constant-Cost Communication is not Reducible to k-Hamming Distance

Documenti analoghi

• No Complete Problem for Constant-Cost Randomized Communication
  di: Fang, Yuting, et al.
  Pubblicazione: (2024)
• Sign-Rank of $k$-Hamming Distance is Constant
  di: Göös, Mika, et al.
  Pubblicazione: (2025)
• Equality is Far Weaker than Constant-Cost Communication
  di: Göös, Mika, et al.
  Pubblicazione: (2025)
• Structure in Communication Complexity and Constant-Cost Complexity Classes
  di: Hatami, Hamed, et al.
  Pubblicazione: (2024)
• No Constant-Cost Protocol for Point--Line Incidence
  di: Göös, Mika, et al.
  Pubblicazione: (2026)