Make an analysis of the time complexity of HNSW on the paper

Duckierstone42 / HNSW-Mathematics-Paper

This repo contains the code for our implementation of the HNSW algorithm (Hierarchical Navigable Small Worlds) for our CS 2051 Math paper.

0 stars 1 forks source link

Open eoriont opened 1 year ago

eoriont commented 1 year ago

Maybe use a recurrence relation and assume worst case or something?

Then use method of substitution to solve it, and figure out what it is big-O of.

This would probably get us some good points because of how directly related to discrete it is.

byoseph3 commented 1 year ago

I'd be down for that. What's the recurrence relation you were thinking of?