Hardness of Permutation Pattern Matching

DOI10.1137/1.9781611974782.24zbMath1410.68146arXiv1608.00529OpenAlexW2485265215MaRDI QIDQ4575761

Jan Kynčl, Vít Jelínek

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Parity permutation pattern matching ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Finding and counting permutations via CSPs ⋮ Combinatorial generation via permutation languages. I. Fundamentals

This page was built for publication: Hardness of Permutation Pattern Matching