Some order dimension bounds for communication complexity problems (Q921909): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A decomposition theorem for partially ordered sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partially Ordered Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3880849 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5203681 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank | |||
Normal rank |
Latest revision as of 10:34, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some order dimension bounds for communication complexity problems |
scientific article |
Statements
Some order dimension bounds for communication complexity problems (English)
0 references
1991
0 references
ordered sets
0 references
communication complexity
0 references