NP (complexity) - CaLiGraph

Property	Value
rdf:type	Complexity class owl:NamedIndividual Term relating to algorithms and data structures
rdfs:label	NP (complexity)
owl:sameAs	dbr:NP_(complexity)
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/List_of_terms_relating_to_algorithms_and_data_structures http://en.wikipedia.org/wiki/Category:Complexity_classes http://en.wikipedia.org/wiki/List_of_complexity_classes
skos:prefLabel	NP (complexity)
skos:altLabel	NP-hard NP NP-complete '''NP''' NP (complexity) NP complete problem NP complete problems NP complexity class NP problems NP_(complexity) hard problems in the Wikipedia article on NP non-deterministic polynomial time non-deterministic polynomial time ('''NP''') non-deterministic polynomial-time nondeterministic polynomial time verifier-based definition
is clgo:knownFor of	Jack Edmonds

About: clgr:NP_(complexity)