Talk:Akra-Bazzi method

From Wikipedia, the free encyclopedia

Great, but someone should describe the method...
Jorge Stolfi 02:10, 31 May 2004 (UTC)

If someone could clarify "where the sub-problems have substantially different sizes," that would be great. I left it in when I edited the article because I am assuming it is meaningful.

Could you add a reference to this result? The article of Akra-Bazzi (M. Akra and L. Bazzi. On the solution of linear recurrence equations. Computational Optimization and Applications, 10:195­210, 1998.) does _not_ prove it. --134.2.12.41 20:05, 16 May 2007 (UTC) Marcus

I am puzzled by the second example on the second page of the Tom Leighton manuscript. Shouldn't it be \Theta\left(x^2 \log \log x\right) ? It makes no sense that the recurrence grows slower when we have the additional term g(x). EIFY (talk) 04:19, 26 February 2008 (UTC)