Pages that link to "Item:Q3210158"
From MaRDI portal
The following pages link to A computer-assisted optimal depth lower bound for nine-input sorting networks (Q3210158):
Displayed 9 items.
- Optimal-depth sorting networks (Q340576) (← links)
- Sorting nine inputs requires twenty-five comparisons (Q899586) (← links)
- Formally proving size optimality of sorting networks (Q1694569) (← links)
- Sorting networks: to the end and back again (Q2424684) (← links)
- Optimizing sorting algorithms by using sorting networks (Q2628305) (← links)
- Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker (Q2945629) (← links)
- New Bounds on Optimal Sorting Networks (Q3195693) (← links)
- Single-exception sorting networks and the computational complexity of optimal sorting network verification (Q3357540) (← links)
- Applying Sorting Networks to Synthesize Optimized Sorting Libraries (Q5743589) (← links)