Pattern Matching in Set Partitions is NP-Complete
Thomas Grubb
TL;DR
This paper demonstrates that pattern matching in set partitions is NP-Complete by reducing the problem from pattern matching in permutations, highlighting computational complexity challenges in this domain.
Contribution
It establishes the NP-Completeness of pattern matching in set partitions through a polynomial time reduction from permutation pattern matching.
Findings
Pattern matching in set partitions is NP-Complete.
Reduction from permutation pattern matching proves computational hardness.
Highlights complexity challenges in set partition pattern matching.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Advanced Combinatorial Mathematics · Algorithms and Data Compression