BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:David Harvey (University of New South Wales\, Sydney)
DTSTART:20200629T230000Z
DTEND:20200630T000000Z
DTSTAMP:20260423T195930Z
UID:ANTS14/3
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/ANTS14/3/">R
 ecent results on fast multiplication</a>\nby David Harvey (University of N
 ew South Wales\, Sydney) as part of Algorithmic Number Theory Symposium (A
 NTS XIV)\n\n\nAbstract\nJoris van der Hoeven and I recently proposed an al
 gorithm that multiplies two $n$-bit integers in $O(n \\log n)$ bit operati
 ons. I will explain the main ideas behind this algorithm\, and discuss the
  difficulties that arise when trying to adapt this algorithm to multiplica
 tion of polynomials in $F[x]$ where $F$ is a finite field.\n\nThis invited
  talk by David Harvey was chaired by Steven Galbraith.\n\nThere are two pa
 pers relevant to this talk:\n<ul>\n<li><a href="https://hal.archives-ouver
 tes.fr/hal-02070778">Integer multiplication in time $O(n\\log n)$</a></li>
 \n<li><a href="https://hal.archives-ouvertes.fr/hal-02070816">Polynomial m
 ultiplication over finite fields in time $O(n \\log n)$</a></li>\n</ul>\nb
 y David Harvey and Joris van der Hoeven.\n
LOCATION:https://researchseminars.org/talk/ANTS14/3/
END:VEVENT
END:VCALENDAR