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

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	Some more detail here: An NP-hard problem is a problem to which any problem in NP can be reduced in polynomial time.
http://www.w3.org/ns/prov#wasQuotedFrom	slashdot.org