Posets with seven linear extensions sortable by three comparisons (Q1944901): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Counting linear extensions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Tournament Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Balancing poset extensions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear probing and graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New results in minimum-comparison sorting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Ford-Johnson algorithm still unbeaten for less than 47 elements / rank | |||
Normal rank |
Latest revision as of 08:26, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Posets with seven linear extensions sortable by three comparisons |
scientific article |
Statements
Posets with seven linear extensions sortable by three comparisons (English)
0 references
28 March 2013
0 references
combinatorial problems
0 references
linear extension
0 references
sorting
0 references
comparison
0 references
posets
0 references