Chronological Thread 

< Chronological >      < Thread >

---

Hello,

Yesterday I was in Reddit when something catch my eye:

"Harvey and Van Der Hoeven claim to have found an O(n log n) integer
multiplication algorithm. This would make significant progress on a
conjecture that has been open for almost 50 years.

TeXmacs creator is coauthor on paper that shows how to multiply integers in
O(n log n) time.”

https://www.reddit.com/r/math/comments/b5aiz1/harvey_and_van_der_hoeven_claim_to_have_found_an/

I can’t understand a word of it. Anyway… Congratulations, Joris! I imagine
that there is a lot of work behind it.

Best regards,

Javier


--
Javier Arántegui
Dept. Tecnologia de Alimentos / Dept. of Food Technology
Universitat de Lleida / University of Lleida (Spain)

Tel. +34 973702595
http://www.tecal.udl.es

Avís legal / Aviso legal / Avertiment legal / Legal notice:
http://www.imatge.udl.cat/avis_legal_lopd.html

---

• [TeXmacs] Off-topic, Javier Arántegui, 03/26/2019
  • Re: [TeXmacs] Off-topic, Massimiliano Gubinelli, 03/26/2019
    • Re: [TeXmacs] Off-topic, Giovanni Piredda, 03/26/2019
      • Re[2]: [TeXmacs] Off-topic, Michael Lachmann, 03/29/2019
      • Re: [TeXmacs] Off-topic, Youjun Hu, 03/30/2019

---

Archive powered by MHonArc 2.6.19.