Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
NP-hard problems
An Entity of Type:
Concept
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Property
Value
dbo:
wikiPageID
22231194
(xsd:integer)
dbo:
wikiPageRevisionID
548082338
(xsd:integer)
dbp:
wikiPageUsesTemplate
dbt
:Cat_main
rdf:
type
skos
:Concept
rdfs:
label
NP-hard problems
(en)
skos:
broader
dbc
:Computational_problems
skos:
prefLabel
NP-hard problems
(en)
skos:
related
dbc
:NP-complete_problems
prov:
wasDerivedFrom
wikipedia-en
:Category:NP-hard_problems?oldid=548082338&ns=14
is
dbo:
wikiPageWikiLink
of
dbr
:MAX-3LIN-EQN
dbr
:MAX-3SAT
dbr
:Metric_k-center
dbr
:Rectilinear_Steiner_tree
dbr
:Radio_coloring
dbr
:Graph_bandwidth
dbr
:Graph_coloring
dbr
:Quadratic_bottleneck_assignment_problem
dbr
:MAX-2-SAT
dbr
:MAXEkSAT
dbr
:Closest_string
dbr
:Travelling_salesman_problem
dbr
:K-minimum_spanning_tree
dbr
:Minimum-weight_triangulation
dbr
:Minimum_relevant_variables_in_linear_system
dbr
:Quadratic_assignment_problem
dbr
:Rectangle_packing
dbr
:NP-hardness
dbr
:Vertex_k-center_problem
is
dcterms:
subject
of
dbr
:MAX-3LIN-EQN
dbr
:MAX-3SAT
dbr
:Metric_k-center
dbr
:Rectilinear_Steiner_tree
dbr
:Radio_coloring
dbr
:Graph_bandwidth
dbr
:Graph_coloring
dbr
:Quadratic_bottleneck_assignment_problem
dbr
:MAX-2-SAT
dbr
:MAXEkSAT
dbr
:Closest_string
dbr
:Travelling_salesman_problem
dbr
:K-minimum_spanning_tree
dbr
:Minimum-weight_triangulation
dbr
:Minimum_relevant_variables_in_linear_system
dbr
:Quadratic_assignment_problem
dbr
:Rectangle_packing
dbr
:NP-hardness
dbr
:Vertex_k-center_problem
is
skos:
broader
of
dbc
:Optimal_scheduling
is
skos:
related
of
dbc
:NP-complete_problems
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 3.0 Unported License