An improved subsumption testing algorithm for the optimal-size sorting network problem

DOI10.1007/978-3-030-19212-9_19OpenAlexW2963287633MaRDI QIDQ2327260

Mădălina Răschip, Cristian Frăsinaru

Publication date: 14 October 2019

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

zbMATH Keywords

perfect matchingcomparator networkoptimal-size sorting networksubsumption relation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

This page was built for publication: An improved subsumption testing algorithm for the optimal-size sorting network problem