Some order dimension bounds for communication complexity problems

DOI10.1007/BF01463947zbMath0709.68022MaRDI QIDQ921909

Ulrich Faigle, Walter Kern

Publication date: 1991

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

communication complexityordered sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Related Items

A connectionist approach to the quadratic assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• Expressing combinatorial optimization problems by linear programs
• A decomposition theorem for partially ordered sets
• Partially Ordered Sets