2023 - T3 - WS1 - Fundamental algorithms and algorithmic complexity

Collection 2023 - T3 - WS1 - Fundamental algorithms and algorithmic complexity

Organizer(s) van der Hoeven, Joris ; Giesbrecht, Mark ; Koiran, Pascal ; Villard, Gilles
Date(s) 25/09/2023 - 29/09/2023
linked URL https://indico.math.cnrs.fr/event/8113/
2 17

Recent progress on deterministic integer factorisation

By 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.

Information about the video

Citation data

  • DOI 10.57987/IHP.2023.T3.WS1.002
  • Cite this video Harvey, David (25/09/2023). Recent progress on deterministic integer factorisation. IHP. Audiovisual resource. DOI: 10.57987/IHP.2023.T3.WS1.002
  • URL https://dx.doi.org/10.57987/IHP.2023.T3.WS1.002

Domain(s)

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback