Pattern Matching in Set Partitions is NP-Complete
Combinatorics
2020-09-02 v1
Abstract
In this note we show that pattern matching in permutations is polynomial time reducible to pattern matching in set partitions. In particular, pattern matching in set partitions is NP-Complete.
Cite
@article{arxiv.2009.00122,
title = {Pattern Matching in Set Partitions is NP-Complete},
author = {Thomas Grubb},
journal= {arXiv preprint arXiv:2009.00122},
year = {2020}
}
Comments
4 pages, comments welcome