<http://experiment.worldcat.org/entity/work/data/1096042999.nt> <http://rdfs.org/ns/void#inDataset> <http://purl.oclc.org/dataset/WorldCat/Works> .
<http://experiment.worldcat.org/entity/work/data/1096042999.nt> <http://schema.org/about> <http://worldcat.org/entity/work/id/1096042999> .
<http://worldcat.org/entity/work/id/1096042999> <http://schema.org/about> <http://id.loc.gov/authorities/subjects/sh85006190> .
<http://worldcat.org/entity/work/id/1096042999> <http://schema.org/about> <http://id.loc.gov/authorities/subjects/sh85082127> .
<http://worldcat.org/entity/work/id/1096042999> <http://schema.org/name> "The hardness of k-means clustering"@en .
<http://worldcat.org/entity/work/id/1096042999> <http://schema.org/creator> <http://worldcat.org/entity/person/id/2630506676> .
<http://worldcat.org/entity/work/id/1096042999> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://schema.org/CreativeWork> .
<http://worldcat.org/entity/work/id/1096042999> <http://schema.org/description> "We show that k-means clustering is an NP-hard optimization problem, even if k is fixed to 2."@en .
<http://worldcat.org/entity/work/id/1096042999> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://schema.org/Book> .
<http://worldcat.org/entity/work/id/1096042999> <http://schema.org/about> <http://id.worldcat.org/fast/1012099> .
<http://worldcat.org/entity/work/id/1096042999> <http://schema.org/workExample> <http://www.worldcat.org/oclc/781857994> .
<http://worldcat.org/entity/work/id/1096042999> <http://schema.org/about> <http://id.worldcat.org/fast/811829> .