Communication complexity of two decision problems

DOI10.1016/0166-218X(92)90167-9zbMath0769.68042MaRDI QIDQ1201105

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)

Related Items (2)

Communication complexity and linearly ordered sets ⋮ Communication complexity in lattices

Cites Work

• Unnamed Item
• Unnamed Item

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