|
gptkbp:instanceOf
|
theoretical computer science
|
|
gptkbp:book
|
gptkb:Parameterized_Complexity_(Downey_and_Fellows,_1999)
|
|
gptkbp:conference
|
gptkb:IPEC_(International_Symposium_on_Parameterized_and_Exact_Computation)
|
|
gptkbp:fieldOfStudy
|
theoretical computer science
|
|
gptkbp:focusesOn
|
algorithmic tractability with respect to parameters
|
|
gptkbp:hasApplication
|
gptkb:artificial_intelligence
computational biology
database theory
graph algorithms
|
|
gptkbp:hasConcept
|
multivariate analysis
fixed-parameter tractability
hardness hierarchy
kernelization
parameterized algorithm
parameterized reduction
slice-wise polynomial time
|
|
gptkbp:hasJournal
|
gptkb:Algorithmica
gptkb:Journal_of_Computer_and_System_Sciences
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Parameterized Complexity
|
|
gptkbp:introduced
|
gptkb:Michael_R._Fellows
gptkb:Rodney_G._Downey
|
|
gptkbp:key
|
gptkb:W[2]
gptkb:para-NP
gptkb:para-P
XP
FPT
W[1]
|
|
gptkbp:relatedTo
|
gptkb:NP-completeness
classical complexity theory
|
|
gptkbp:studies
|
parameterized problems
|
|
gptkbp:surveyedBy
|
gptkb:Parameterized_Complexity_Theory_(Flum_and_Grohe,_2006)
|
|
gptkbp:bfsParent
|
gptkb:Rod_Downey
|
|
gptkbp:bfsLayer
|
7
|