Efficient Approaches to Integer and Polynomial Multiplication by Paul Harshbarger '24

Efficient Approaches to Integer and Polynomial Multiplication by Paul Harshbarger ’24, Monday December 4, 1:00 – 1:50pm, North Science Building 113, Wachenheim

Abstract: Multiplication for humans and computers alike can be a laborious process involving many operations. There now exists a method to multiply extremely large integers and polynomials with much less operations than traditionally, and previously, proven methods like Karatsuba’s algorithm. His insights rely greatly on Fourier transforms and the beauty of complex numbers, with applications to cryptography and data processing.