This is the mail archive of the
gsl-discuss@sourceware.org
mailing list for the GSL project.
Re: DHT performance
- From: Brian Gough <bjg at network-theory dot co dot uk>
- To: Gideon Simpson <simpson at math dot toronto dot edu>
- Cc: gsl-discuss at sourceware dot org
- Date: Tue, 12 May 2009 09:43:37 +0100
- Subject: Re: DHT performance
- References: <21FF16B9-8781-4C1E-BC11-0C90C4123DE0@math.toronto.edu>
At Sat, 9 May 2009 20:34:08 -0400,
Gideon Simpson wrote:
>
> Am I right that the DHT algorithm is not *fast* in the sense that it's
> O(N^2)?
I believe that's true, yes. As I understand it, the advantage is that
the overall constant in the runtime is small due to everything being
precomputed.