Finding and Counting Permutations via CSPs

DOI10.4230/LIPICS.IPEC.2019.1MaRDI QIDQ5875533zbMATH OpenOpenAlexFDO

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

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

constraint satisfactionexponential timepattern matchingpermutations

Mathematics Subject Classification ID

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

Recommendations

• Finding and counting permutations via CSPs
• Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations
• Finding small patterns in permutations in linear time
• Pattern matching for 321-avoiding permutations
• Pattern matching for permutations

Cited in

(10)

• Algorithms for testing occurrences of length 4 patterns in permutations
• Finding and counting permutations via CSPs
• scientific article; zbMATH DE number 1617282 (Why is no real title available?)
• The complexity of counting poset and permutation patterns
• On exact algorithms for the permutation CSP
• scientific article; zbMATH DE number 91009 (Why is no real title available?)
• Permutation patterns are hard to count
• Finding small patterns in permutations in linear time
• Counting and Generating Permutations Using Timed Languages
• scientific article; zbMATH DE number 7765381 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875533)