Talk:Iterated logarithm

From Wikipedia, the free encyclopedia

Contents 1 Iterated log vs Ackermann 2 Vs. "Law of" 3 Figure 1 4 Reference?

[edit] Iterated log vs Ackermann

"The disjoint set data structure's union and find operations" is given as an example algorithm using iterated log complexity, but Disjoint_set_data_structure mentions the (better) inverse Ackermann bound. -- hagman --195.227.74.194 10:11, 15 November 2006 (UTC)

Yes, there's an old version that has iterated log complexity. I can't recall its name off the top of my head. CRGreathouse (t | c) 17:44, 15 November 2006 (UTC)

[edit] Vs. "Law of"

Do Iterated logarithm and Law of the iterated logarithm have something in common despite the name? --Abdull 13:31, 3 March 2006 (UTC)

[edit] Figure 1

It would be nice if Figure 1 illustrated the line segments shown with arrowheads 12.208.40.109 16:53, 30 May 2006 (UTC)

[edit] Reference?

I haven't finished reading it yet, but there's a mention of the iterated logarithm in Sublogarithmic Ambiguity that may be of use in the article. CRGreathouse (t | c) 07:19, 26 September 2006 (UTC)

Another: Dr. Jamie Andrews suggests the possibility of an O(n^{log * n}) algorithm for an NP-complete problem (rendiring P =? NP moot). [1] CRGreathouse (t | c) 05:10, 28 September 2006 (UTC)