Jump to content

Talk:Pohlig–Hellman algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Nroets (talk | contribs) at 19:50, 7 April 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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(sqrt(B) log(|G|)) or something ? -- Nic Roets 19:36, 7 April 2006 (UTC)[reply]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Pohlig–Hellman_algorithm&oldid=47450617"