On counting 3-D matchings of size \(k\) (Q1040648)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5638417
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On counting 3-D matchings of size \(k\) |
scientific article; zbMATH DE number 5638417 |
Statements
On counting 3-D matchings of size \(k\) (English)
0 references
25 November 2009
0 references
3-D matching
0 references
parameterized algorithm
0 references
approximation algorithm
0 references
randomized algorithm
0 references
counting complexity
0 references
0.978079915046692
0 references
0.841597855091095
0 references
0.8398638963699341
0 references
0.8145945072174072
0 references
