Practical Algorithms for Finding Extremal Sets

DOI10.1145/2893184zbMath1365.68460arXiv1508.01753OpenAlexW2120457683MaRDI QIDQ5266618

Martin Cvetanov Marinov, David Gregg, Nicholas Nash

Publication date: 16 June 2017

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.01753

zbMATH Keywords

parallel algorithmextremal setsmemoizationpractical algorithmitemset

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10)

Uses Software

• MiniSat

Cites Work

• Unnamed Item
• An old sub-quadratic algorithm for finding extremal sets
• Optimal-depth sorting networks
• Opportunistic algorithms for eliminating supersets
• Finding extremal sets in less than quadratic time
• Fast sequential and parallel algorithms for finding extremal sets
• Theory and Applications of Satisfiability Testing

This page was built for publication: Practical Algorithms for Finding Extremal Sets