The following pages link to (Q5675725):
Displayed 9 items.
- Optimal-depth sorting networks (Q340576) (← links)
- Sorting nine inputs requires twenty-five comparisons (Q899586) (← links)
- Sorting in one round (Q1152382) (← links)
- Formally proving size optimality of sorting networks (Q1694569) (← links)
- Finding the \(\alpha n\)-th largest element (Q1912751) (← links)
- Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker (Q2945629) (← links)
- A computer-assisted optimal depth lower bound for nine-input sorting networks (Q3210158) (← links)
- Single-exception sorting networks and the computational complexity of optimal sorting network verification (Q3357540) (← links)
- Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof (Q3453106) (← links)