Improved lower bounds on the on-line chain partitioning of posets of bounded dimension (Q6139864): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4361283673 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Effective Version of Dilworth's Theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On-line chain partitions of orders / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4722060 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On-line chain partitions of orders: a survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A theory of recursive dimension of ordered sets / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 16:21, 21 August 2024
scientific article; zbMATH DE number 7780735
Language | Label | Description | Also known as |
---|---|---|---|
English | Improved lower bounds on the on-line chain partitioning of posets of bounded dimension |
scientific article; zbMATH DE number 7780735 |
Statements
Improved lower bounds on the on-line chain partitioning of posets of bounded dimension (English)
0 references
19 December 2023
0 references
on-line algorithm
0 references
chain partitioning
0 references
poset dimension
0 references