About: Parameterized complexity

An Entity of Type: academic subject, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Branch of computational complexity theory

Property	Value
dbo:description	branche de la théorie de la complexité computationnelle (fr) branch of computational complexity theory (en)
dbo:wikiPageExternalLink	https://www.springer.com/sgw/cda/frontpage/0,11855,5-0-22-1519914-0,00.html%3Freferer=www.springer.de%2Fcgi-bin%2Fsearch_book.pl%3Fisbn%3D0-387-94883-X http://fpt.wikidot.com/ http://www.sprg.uniroma2.it/home/cesati/research/compendium/ https://web.archive.org/web/20051125014940/http:/comjnl.oxfordjournals.org/ https://www.springer.com/east/home/generic/search/results%3FSGWID=5-40109-22-141358322-0 http://www.oup.com/uk/catalogue/%3Fci=9780198566076 https://web.archive.org/web/20080924051521/http:/www.oup.com/uk/catalogue/%3Fci=9780198566076
dbo:wikiPageWikiLink	dbc:Parameterized_complexity dbr:P_versus_NP_problem dbr:Clique_(graph_theory) dbr:Function_(mathematics) dbr:Turing_machine_equivalents dbr:Satisfiability dbr:Vertex_cover dbr:Independent_set_(graph_theory) dbr:Hamming_weight dbc:Computational_complexity_theory dbr:Kernelization dbr:Graph_coloring dbr:Computer_science dbr:Computational_complexity_theory dbr:Reduction_(complexity) dbr:Dominating_set dbr:Nondeterministic_algorithm dbr:NP-complete dbr:NP-hard dbr:Exponential_time dbr:Efficient_polynomial-time_approximation_scheme dbr:P_versus_NP dbr:Fixed-parameter_tractable dbr:Circuit_satisfiability dbr:Computational_problems dbr:Running_time dbr:Vertex_cover_problem dbr:Slicewise dbr:Weft_(circuit)
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Redirect dbt:Cite_conference dbt:Sfnp dbt:Mvar dbt:Harvtxt dbt:Tmath dbt:Sans-serif dbt:Short_description
dct:subject	dbc:Parameterized_complexity dbc:Computational_complexity_theory
rdf:type	dbo:AcademicSubject
rdfs:label	Parameterized complexity (en) Parametrisierter Algorithmus (de) Complejidad parametrizada (es) Complexité paramétrée (fr) Complexidade parametrizada (pt)
owl:sameAs	freebase:Parameterized complexity wikidata:Parameterized complexity dbpedia-de:Parameterized complexity dbpedia-fr:Parameterized complexity dbpedia-pt:Parameterized complexity dbpedia-es:Parameterized complexity dbpedia-global:Parameterized complexity
prov:wasDerivedFrom	wikipedia-en:Parameterized_complexity?oldid=1292877732&ns=0
foaf:isPrimaryTopicOf	wikipedia-en:Parameterized_complexity
is dbo:academicDiscipline of	dbr:Stefan_Szeider
is dbo:knownFor of	dbr:Rolf_Niedermeier
is dbo:wikiPageRedirects of	dbr:Fixed-parameter_tractability dbr:Fixed-parameter_algorithm dbr:Fixed-parameter_tractable dbr:XP_(class) dbr:XP_(complexity_class) dbr:FPT_(complexity_class) dbr:W(1) dbr:W(2) dbr:W-Hierarchy dbr:W-hierarchy dbr:W_(complexity_class) dbr:W_Hierarchy dbr:W_hierarchy dbr:Parameterised_complexity dbr:Parameterized_(Multivariate)_Complexity dbr:Parameterized_Complexity dbr:Parametrised_complexity dbr:Parametrized_complexity
is dbo:wikiPageWikiLink of	dbr:Planar_separator_theorem dbr:List_of_computability_and_complexity_topics dbr:Dictatorship_mechanism dbr:Intersection_number_(graph_theory) dbr:Matroid_minor dbr:Upward_planar_drawing dbr:Metric_dimension_(graph_theory) dbr:NP-completeness dbr:Clique_(graph_theory) dbr:Edge_coloring dbr:Frances_A._Rosamond dbr:Erik_Demaine dbr:W1 dbr:Vertex_cover dbr:Paul_Seymour_(mathematician) dbr:Claw-free_graph dbr:Courcelle's_theorem dbr:Hadwiger_number dbr:Halin's_grid_theorem dbr:Matroid_rank dbr:XP dbr:Feedback_arc_set dbr:Kernelization dbr:Steiner_tree_problem dbr:Exponential_time_hypothesis dbr:Bidimensionality dbr:Chordal_graph dbr:Interval_graph dbr:Clique_problem dbr:Graver_basis dbr:Proof_complexity dbr:Bipartite_graph dbr:MAXEkSAT dbr:Closest_string dbr:Cograph dbr:Sunflower_(mathematics) dbr:Computational_complexity_theory dbr:Longest_path_problem dbr:Indifference_graph dbr:No-three-in-line_problem dbr:Tree-depth dbr:Boxicity dbr:Branch-decomposition dbr:Time_complexity dbr:Treewidth dbr:Hans_L._Bodlaender dbr:Nerode_Prize dbr:Cristina_Bazgan dbr:Graph_homomorphism dbr:Clique-width dbr:Equitable_coloring dbr:Circuit_rank dbr:Michael_Fellows dbr:Michael_Langston dbr:Trémaux_tree dbr:Proportional_approval_voting dbr:1-planar_graph dbr:2-satisfiability dbr:Entropy_compression dbr:Connected_dominating_set dbr:Book_embedding dbr:Biclique-free_graph dbr:Chordal_completion dbr:Logic_of_graphs dbr:Map_graph dbr:Matroid_girth dbr:Grundy_number dbr:Iterative_compression dbr:Klam_value dbr:Cluster_graph dbr:Cop_number dbr:Planarization dbr:Stefan_Szeider dbr:Pinar_Heggernes dbr:Strong_connectivity_augmentation dbr:Layered_graph_drawing dbr:Mohammad_Hajiaghayi dbr:Rotation_distance dbr:Strip_packing_problem dbr:Runtime_predictive_analysis dbr:Barrier_resilience dbr:Betweenness dbr:Rank-width dbr:Fixed-parameter_tractability dbr:Martin_Grohe dbr:Twin-width dbr:TerminusDB dbr:Rolf_Niedermeier dbr:Induced_matching dbr:Splittance dbr:Computational_social_choice dbr:Parsimonious_reduction dbr:Eun_Jung_Kim_(parameterized_complexity) dbr:Saket_Saurabh dbr:Vida_Dujmović dbr:Fixed-parameter_algorithm dbr:Fixed-parameter_tractable dbr:XP_(class) dbr:XP_(complexity_class) dbr:FPT_(complexity_class) dbr:W(1) dbr:W(2) dbr:W-Hierarchy dbr:W-hierarchy dbr:W_(complexity_class) dbr:W_Hierarchy dbr:W_hierarchy dbr:Parameterised_complexity dbr:Parameterized_(Multivariate)_Complexity dbr:Parameterized_Complexity dbr:Parametrised_complexity dbr:Parametrized_complexity
is dbp:knownFor of	dbr:Rolf_Niedermeier
is foaf:primaryTopic of	wikipedia-en:Parameterized_complexity