Some order dimension bounds for communication complexity problems (Q921909): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ulrich Faigle / rank
Normal rank
 
Property / author
 
Property / author: Walter Kern / rank
Normal rank
 
Property / author
 
Property / author: Ulrich Faigle / rank
 
Normal rank
Property / author
 
Property / author: Walter Kern / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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
    0 references
    0 references

    Identifiers