The communication complexity of interval orders

The communication complexity of interval orders

0.00 Avg rating0 Votes
Article ID: iaor19931115
Country: Netherlands
Volume: 40
Issue: 1
Start Page Number: 19
End Page Number: 28
Publication Date: Nov 1992
Journal: Discrete Applied Mathematics
Authors: , ,
Abstract:

The communication complexity of interval orders is studied within the following model. Two players choose two elements x and y and want to determine whether x<y holds by exchanging as few bits of information as possible. It is shown that an optimal one-way protocol exists by first establishing a rank-optimality result for a subclass of generalized interval orders. It turns out that the deterministic and nondeterministic communication complexities coincide for generalized interval orders. The analogous statement for the complementary relation is true for interval orders in the strict sense while it need not hold for generalized interval orders.

Reviews

Required fields are marked *. Your email address will not be published.