About: Polynomial-time problems

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

Property	Value
dbo:wikiPageID	3868527 (xsd:integer)
dbo:wikiPageRevisionID	588788427 (xsd:integer)
dbp:wikiPageUsesTemplate	dbt:Commons_category
rdf:type	skos:Concept
rdfs:label	Polynomial-time problems (en)
skos:broader	dbc:Computational_problems
skos:prefLabel	Polynomial-time problems (en)
prov:wasDerivedFrom	wikipedia-en:Category:Polynomial-time_problems?oldid=588788427&ns=14
is dbo:wikiPageWikiLink of	dbr:Element_distinctness_problem dbr:Bellman–Ford_algorithm dbr:Matching_(graph_theory) dbr:Shortest_path_problem dbr:Collision_problem dbr:Emptiness_problem dbr:Widest_path_problem dbr:Network_simplex_algorithm dbr:3SUM dbr:Floyd–Warshall_algorithm dbr:K_shortest_path_routing dbr:Edge_cover dbr:Assignment_problem dbr:Circuit_Value_Problem dbr:Minimum_spanning_tree dbr:Longest_common_subsequence_problem dbr:Seidel's_algorithm dbr:Yen's_algorithm
is dcterms:subject of	dbr:Element_distinctness_problem dbr:Bellman–Ford_algorithm dbr:Matching_(graph_theory) dbr:Shortest_path_problem dbr:Collision_problem dbr:Emptiness_problem dbr:Widest_path_problem dbr:Network_simplex_algorithm dbr:3SUM dbr:Floyd–Warshall_algorithm dbr:K_shortest_path_routing dbr:Edge_cover dbr:Assignment_problem dbr:Circuit_Value_Problem dbr:Minimum_spanning_tree dbr:Longest_common_subsequence_problem dbr:Seidel's_algorithm dbr:Yen's_algorithm

This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License