New n log n algorithm for high-precision multiplication

Nelson H. F. Beebe beebe at
Fri Apr 12 20:08:33 UTC 2019

The noted numerical analyst, and multiple-precision arithmetic package
author, David Bailey, has just posted a new article

	An n log(n) algorithm for multiplication

at his Math Scholar site.  It refers to a 42-page work of 18 March
2019 available at

	Integer multiplication in time O(n log n)
	David Harvey, Joris Van Der Hoeven

That archive is likely to be familiar to many gmp-devel list members,
so perhaps their algorithm may already be implemented and tested in

- Nelson H. F. Beebe                    Tel: +1 801 581 5254                  -
- University of Utah                    FAX: +1 801 581 4148                  -
- Department of Mathematics, 110 LCB    Internet e-mail: beebe at  -
- 155 S 1400 E RM 233                       beebe at  beebe at -
- Salt Lake City, UT 84112-0090, USA    URL: -

More information about the gmp-devel mailing list