Pattern Matching in Set Partitions is NP-Complete

From MaRDI portal
Pattern Matching in Set Partitions is NP-Complete (scientific article from arXiv)

MaRDI QIDQ7124116arXivFDO

Authors Thomas L. Grubb

Publication date 2020

Published in arXiv


arXiv classification

math.CO















This page was built for publication: Pattern Matching in Set Partitions is NP-Complete

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Pattern_Matching_in_Set_Partitions_is_NP-Complete_(scientific_article_from_arXiv)&oldid=106877951"
Powered by MediaWiki