Communication complexity of two decision problems

DOI10.1016/0166-218X(92)90167-9MaRDI QIDQ1201105zbMATH OpenFDO

Authors Anders Bjoerner, Johan Karlander, Bernt Lindström

Publication date 17 January 1993

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

communication complexityrelatively prime integerscommon inversion of permutations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Communication complexity of some number theoretic functions
• scientific article; zbMATH DE number 1769898
• On the complexity of communication complexity
• Communication complexity
• On the ``log rank-conjecture in communication complexity

Cited in

(5)

• Communication complexity and linearly ordered sets
• Recognition problems and communication complexity.
• Communication complexity in lattices
• Communication complexity of permutation-invariant functions
• Communication complexity of some number theoretic functions

This page was built for publication: Communication complexity of two decision problems

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