Treffer: The communication complexity of interval orders
Title:
The communication complexity of interval orders
Authors:
Source:
Combinatorial methods in VLSIDiscrete applied mathematics. 40(1):19-28
Publisher Information:
Amsterdam; Lausanne; New York, NY: Elsevier, 1992.
Publication Year:
1992
Physical Description:
print, 11 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Méthodes mathématiques, Mathematical methods, Circuit VLSI, VLSI circuit, Circuito VLSI, Communication, Comunicación, Complexité calcul, Computing complexity, Complejidad cálculo, Etude théorique, Theoretical study, Estudio teórico, Intervalle, Interval, Intervalo
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Univ. Twente, fac. applied mathematics, 7500 AE Enschede, Netherlands
ISSN:
0166-218X
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.4905326
Database:
PASCAL Archive
Weitere Informationen
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.