Assertion: dimensional euclidean space | /r/CapableOf | use polynomial preprocessing
Facets:
Source sentences:
text: The informal observation usually referred to as the curse of dimensionality states that there is no general-purpose exact solution for NNS in high-dimensional Euclidean space using polynomial preprocessing and polylogarithmic search time.