The Complexity of Perfect Matching Problems on Dense Hypergraphs (Q3652249)
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 Perfect Matching Problems on Dense Hypergraphs |
scientific article; zbMATH DE number 5649415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity of Perfect Matching Problems on Dense Hypergraphs |
scientific article; zbMATH DE number 5649415 |
Statements
The Complexity of Perfect Matching Problems on Dense Hypergraphs (English)
0 references
17 December 2009
0 references
0.96710825
0 references
0.96710825
0 references
0.96031237
0 references
0.9536253
0 references
0.95328534
0 references
0.9236325
0 references
0 references
0.9083508
0 references
0 references
