Talk:Pohlig–Hellman algorithm

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Stub	This article has been rated as Stub-class on Wikipedia's content assessment scale.
???	This article has not yet received a rating on the project's priority scale.

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

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(B^1/2 log_B|G|) ? -- Nic Roets 19:36, 7 April 2006 (UTC)[reply]