The Complexity of Perfect Matching Problems on Dense Hypergraphs (Q3652249): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q396628 |
Changed an Item |
||
| Property / author | |||
| Property / author: Marek Karpinski / rank | |||
Normal rank | |||
Revision as of 09:10, 14 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Perfect Matching Problems on Dense Hypergraphs |
scientific article |
Statements
The Complexity of Perfect Matching Problems on Dense Hypergraphs (English)
0 references
17 December 2009
0 references
