Some order dimension bounds for communication complexity problems

DOI10.1007/BF01463947zbMATH Open0709.68022MaRDI QIDQ921909FDOQ921909

Authors: U. Faigle, Walter Kern 

Publication date: 1991

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

Recommendations

• Dimension-free bounds and structural results in communication complexity
• The communication complexity of interval orders
• scientific article; zbMATH DE number 2170852
• Communication complexity and linearly ordered sets
• scientific article; zbMATH DE number 4068270
• Lower bounds on communication complexity
• Lower bounds in communication complexity
• Communication Complexity and Lower Bounds on Multilective Computations
• On the ``log rank-conjecture in communication complexity

zbMATH Keywords

communication complexityordered sets

Mathematics Subject Classification ID

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

Cites Work

• Expressing combinatorial optimization problems by linear programs
• Partially Ordered Sets
• A decomposition theorem for partially ordered sets
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• Ordered biclique partitions and communication complexity problems
• Some improved bounds on communication complexity via new decomposition of cliques
• A connectionist approach to the quadratic assignment problem
• Deterministic communication vs. partition number
• Title not available (Why is that?)
• Communication Lower Bounds Via the Chromatic Number
• The communication complexity of interval orders

This page was built for publication: Some order dimension bounds for communication complexity problems

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