Computational complexity of counting coincidences

From MaRDI portal

Publication:6614012

Jump to:navigation, search

DOI10.1016/j.tcs.2024.114776MaRDI QIDQ6614012

Igor Pak, Swee Hong Chan

Publication date: 7 October 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

permanent domino tiling graph matching standard Young tableaux Kronecker coefficient linear extensions of posets \#P-completeness matroid bases order ideals of posets

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Computational complexity of counting coincidences

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6614012&oldid=40167700"