Geometric Laplacians on Self-Conformal Fractal Curves in the Plane
De Naotaka Kajino
Geometric Laplacians on Self-Conformal Fractal Curves in the Plane
De Naotaka Kajino
De David Harvey
Apparaît dans la collection : 2023 - T3 - WS1 - Fundamental algorithms and algorithmic complexity
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.