Sorting nine inputs requires twenty-five comparisons
From MaRDI portal
Publication:899586
DOI10.1016/J.JCSS.2015.11.014zbMATH Open1333.68087OpenAlexW2208979138MaRDI QIDQ899586FDOQ899586
Peter Schneider-Kamp, Luís Cruz-Filipe, Michael Codish, M. Frank
Publication date: 30 December 2015
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2015.11.014
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Principles and Practice of Constraint Programming – CP 2003
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- The challenge of computer mathematics
- Sorting in \(c \log n\) parallel steps
- A computer-assisted optimal depth lower bound for nine-input sorting networks
- Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems
- Optimal Sorting Networks
- Bounds on the size of test sets for sorting and related networks
- Efficient generation of the binary reflected gray code and its applications
- Toward a Lower Bound for Sorting Networks
- Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker
- A Sorting Problem
- Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof
- Extraction in Coq: An Overview
- An Improved Lower Bound for Sorting Networks
Cited In (10)
- The Half Cleaner Lemma: Constructing Efficient Interconnection Networks from Sorting Networks
- Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker
- Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof
- Sorting networks: to the end and back again
- How to get more out of your oracles
- Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description)
- Expressing Symmetry Breaking in DRAT Proofs
- Optimal-depth sorting networks
- Optimizing sorting algorithms by using sorting networks
- Formally proving size optimality of sorting networks
This page was built for publication: Sorting nine inputs requires twenty-five comparisons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899586)
