Talk:Pohlig-Hellman algorithm

From Wikipedia, the free encyclopedia

Polynomial time in what? Watson Ladd 23:38, 9 March 2006 (UTC)

Good point. Quuxplusone's remark at the end of Smooth number looks a bit more accurate. However, if you apply his comment to a sequence of groups with order 3, 9, 27,... then the time taken by Pohlig-Hellman should have a maximum, which is clearly not the case. Perhaps it should be O(B1/2 logB|G|) ? -- Nic Roets 19:36, 7 April 2006 (UTC)
Retrieved from "http://en.wikipedia.org../../../p/o/h/Talk%7EPohlig-Hellman_algorithm_083c.html"