Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The communication complexity of interval orders

From MaRDI portal
Publication:1201817
Jump to:navigation, search

DOI10.1016/0166-218X(92)90019-7zbMath0757.94002OpenAlexW2114061372MaRDI QIDQ1201817

Ulrich Faigle, Rainer Schrader, György Turán

Publication date: 17 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90019-7


zbMATH Keywords

communication complexitiescommunication complexity of interval ordersoptimal one-way protocol


Mathematics Subject Classification ID

Communication theory (94A05)


Related Items (2)

Partial orders and their convex subsets ⋮ Tree-visibility orders



Cites Work

  • Interval orders without odd crowns are defect optimal
  • On the complexity of interval orders and semiorders
  • Intransitive indifference with unequal indifference intervals
  • Minimizing Setups for Ordered Sets: A Linear Algebraic Approach




This page was built for publication: The communication complexity of interval orders

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1201817&oldid=13264891"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 06:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki