Parameterized Complexity Theory
GPTKB entity
Statements (29)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:logic
|
| gptkbp:analyzes |
algorithmic complexity with respect to parameters
|
| gptkbp:application |
gptkb:artificial_intelligence
computational biology graph algorithms |
| gptkbp:fieldOfStudy |
computer science
|
| gptkbp:focusesOn |
parameterized problems
|
| gptkbp:hasConcept |
fixed-parameter tractability
kernelization W-hierarchy parameterized reductions |
| https://www.w3.org/2000/01/rdf-schema#label |
Parameterized Complexity Theory
|
| gptkbp:introduced |
gptkb:Michael_R._Fellows
gptkb:Rodney_G._Downey |
| gptkbp:notableBook |
gptkb:Parameterized_Complexity_(Downey_and_Fellows,_1999)
|
| gptkbp:notableConference |
IPEC
IWPEC |
| gptkbp:relatedTo |
gptkb:NP-completeness
gptkb:W[2] gptkb:para-NP gptkb:para-P theoretical computer science algorithm design XP complexity classes FPT W[1] |
| gptkbp:bfsParent |
gptkb:Jörg_Flum
|
| gptkbp:bfsLayer |
6
|