Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Complexity #24

Open
OndrejPetrzilka opened this issue Feb 25, 2017 · 0 comments
Open

Complexity #24

OndrejPetrzilka opened this issue Feb 25, 2017 · 0 comments

Comments

@OndrejPetrzilka
Copy link

It would be nice to add approximate calculation complexity into README file. Something like O(N * D * log(D)). Where N is number of points and D is dimension. (I don't know the actual complexity, that was just the example).

I didn't find this in the paper and it's hard to get it from code. From charts it seems something like O(N * D), I'm not sure that's right.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant