De David Harvey
There are several deterministic factoring algorithms of complexity $N^{1/4+o(1)}$ going back to the 1970s. A few years ago Hittmeir lowered the exponent to $2/9$, and I subsequently improved it further to $1/5$. In this talk I will explain the key ideas behind these new algorithms.
De Joachim von zur Gathen
De Sébastien Tavenas
De Pranjal Dutta
De Nitin Saxena
De Clément Pernet
De Fredrik Johansson
De Lihong Zhi
De Annie Cuyt
De Juan Camilo Arosemena Serrato
De Giuseppe Savaré
De Juan Camilo Arosemena Serrato
De Amine Marrakchi
De Shirly Geffen
De Francesca Arici
