Counting matchings of size \(k\) is \#W[1]-hard (Q5326574)
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 6195438
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting matchings of size \(k\) is \#W[1]-hard |
scientific article; zbMATH DE number 6195438 |
Statements
Counting Matchings of Size k Is $\sharp$ W[1]-Hard (English)
0 references
6 August 2013
0 references
0.9346305131912231
0 references
0.823840320110321
0 references
0.8059473037719727
0 references
0.8031235337257385
0 references
