The \(k\)-feature set problem is \(W[2]\)-complete (Q1877698): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4393480 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Gentle Introduction to Memetic Algorithms / rank | |||
Normal rank | |||
Latest revision as of 20:09, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The \(k\)-feature set problem is \(W[2]\)-complete |
scientific article |
Statements
The \(k\)-feature set problem is \(W[2]\)-complete (English)
0 references
19 August 2004
0 references
