About: http://webisa.webdatacommons.org/423554160

Property	Value
http://www.w3.org/1999/02/22-rdf-syntax-ns#type	http://www.w3.org/ns/prov#Entity
http://www.w3.org/ns/prov#value	A NP-hard problem is a problem such that every problem in NP poly-time ... (NP-complete). ... route shorter than k for this graph!, ... (sci.crypt)Re: NP-complete and NP-Hard?...
http://www.w3.org/ns/prov#wasQuotedFrom	derkeiler.com