Finding and counting permutations via CSPs
From MaRDI portal
Publication:6323601
DOI10.1007/s00453-021-00812-zzbMath1515.68216arXiv1908.04673MaRDI QIDQ6323601
László Kozma, Dániel Marx, Benjamin Aram Berendsohn
Publication date: 13 August 2019
Analysis of algorithms (68W40) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05)
This page was built for publication: Finding and counting permutations via CSPs