* DHT performance
@ 2009-05-10 7:51 Gideon Simpson
2009-05-12 8:44 ` Brian Gough
0 siblings, 1 reply; 2+ messages in thread
From: Gideon Simpson @ 2009-05-10 7:51 UTC (permalink / raw)
To: gsl-discuss
Am I right that the DHT algorithm is not *fast* in the sense that it's
O(N^2)?
-gideon
^ permalink raw reply [flat|nested] 2+ messages in thread
* Re: DHT performance
2009-05-10 7:51 DHT performance Gideon Simpson
@ 2009-05-12 8:44 ` Brian Gough
0 siblings, 0 replies; 2+ messages in thread
From: Brian Gough @ 2009-05-12 8:44 UTC (permalink / raw)
To: Gideon Simpson; +Cc: gsl-discuss
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.
^ permalink raw reply [flat|nested] 2+ messages in thread
end of thread, other threads:[~2009-05-12 8:44 UTC | newest]
Thread overview: 2+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2009-05-10 7:51 DHT performance Gideon Simpson
2009-05-12 8:44 ` Brian Gough
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).