The complexity of approximately counting stable matchings (Q441846)
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: The complexity of approximately counting stable matchings |
scientific article; zbMATH DE number 6064134
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of approximately counting stable matchings |
scientific article; zbMATH DE number 6064134 |
Statements
The complexity of approximately counting stable matchings (English)
0 references
8 August 2012
0 references
stable marriage problem
0 references
approximation-preserving reduction
0 references
counting independent sets in bipartite graphs
0 references
