Finding and Counting Permutations via CSPs

DOI10.4230/LIPIcs.IPEC.2019.1OpenAlexW2997069702MaRDI QIDQ5875533

Dániel Marx, László Kozma, Benjamin Aram Berendsohn

Publication date: 3 February 2023

Full work available at URL: https://pure.mpg.de/pubman/item/item_3279905_3/component/file_3341215/LIPIcs-IPEC-2019-1.pdf

zbMATH Keywords

permutationspattern matchingconstraint satisfactionexponential time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

Unnamed Item

This page was built for publication: Finding and Counting Permutations via CSPs