Pages that link to "Item:Q3796782"
From MaRDI portal
The following pages link to A New Lower Bound for the Set-Partitioning Problem (Q3796782):
Displayed 6 items.
- Finding the \(\alpha n\)-th largest element (Q1912751) (← links)
- A selectable sloppy heap (Q2312418) (← links)
- Selection problems via \(m\)-ary queries (Q2366172) (← links)
- Select with Groups of 3 or 4 (Q3449816) (← links)
- Selection Algorithms with Small Groups (Q4983545) (← links)
- (Q6087214) (← links)