English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

After my paper [2] was electronically published by Mathematics of Computation, I came across the PhD thesis of professor I. Y. Potemine [6]. In Section 4.3 of his thesis, an algorithm for factoring polynomials is proposed which is equivalent to the algorithm discussed in my paper. Potemine’s algorithm is acknowledged in my PhD thesis [1]. Our algorithms were found independently, both as analogues of H. W. Lenstra’s well-known Elliptic Curve Method for factoring integers; cf. [3]. Professor Potemine informed me that there are two even earlier publications in which his algorithm is described; namely [5] and [4]. Nevertheless, a complexity analysis and a comparison with the well-known Cantor–Zassenhaus algorithm can only be found in [2] and [1].

Addendum to “Factoring polynomials over finite fields with Drinfeld modules”