Pages that link to "Item:Q899586"
From MaRDI portal
The following pages link to Sorting nine inputs requires twenty-five comparisons (Q899586):
Displaying 10 items.
- Optimal-depth sorting networks (Q340576) (← links)
- How to get more out of your oracles (Q1687729) (← 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)
- Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof (Q3453106) (← links)
- Expressing Symmetry Breaking in DRAT Proofs (Q3454124) (← links)
- Logic Programming with Graph Automorphism: Integrating<tt>nauty</tt>with Prolog (Tool Description) (Q4593050) (← links)
- The Half Cleaner Lemma: Constructing Efficient Interconnection Networks from Sorting Networks (Q5087836) (← links)
