Pages that link to "Item:Q276436"

The following pages link to A subexponential upper bound for the on-line chain partitioning problem (Q276436):

Displaying 4 items.

• First-Fit is linear on posets excluding two long incomparable chains (Q651432) (← links)
• An easy subexponential bound for online chain partitioning (Q1753118) (← links)
• On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains (Q2225405) (← links)
• Improved lower bound on the on-line chain partitioning of semi-orders with representation (Q6056742) (← links)