Assertion: algorithm's time | /r/CapableOf | increase beyond this size
Facets:
value: quickly
type: MANNER
Source sentences:
text: As expected, due to the NP-hardness of the subjacent optimization problem, the computational time of optimal algorithms for K-means quickly increases beyond this size.