Counting Matchings of Size k Is $\sharp$ W[1]-Hard (Q5326574): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/978-3-642-39206-1_30 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2397172610 / rank | |||
Normal rank |
Latest revision as of 21:28, 19 March 2024
scientific article; zbMATH DE number 6195438
Language | Label | Description | Also known as |
---|---|---|---|
English | Counting Matchings of Size k Is $\sharp$ 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