Exact deterministic communication complexity CC(f) is NP-hard to compute, resolving Yao's question for the standard protocol-tree definition.
Some complexity questions related to distributive computing
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Communication Complexity is NP-hard
Exact deterministic communication complexity CC(f) is NP-hard to compute, resolving Yao's question for the standard protocol-tree definition.