Computational complexity of counting coincidences (Q6614012)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computational complexity of counting coincidences |
scientific article; zbMATH DE number 7921846
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of counting coincidences |
scientific article; zbMATH DE number 7921846 |
Statements
Computational complexity of counting coincidences (English)
0 references
7 October 2024
0 references
domino tiling
0 references
permanent
0 references
\#P-completeness
0 references
graph matching
0 references
linear extensions of posets
0 references
order ideals of posets
0 references
matroid bases
0 references
Kronecker coefficient
0 references
standard Young tableaux
0 references
0 references
0 references
0 references
0 references
