New n log n algorithm for high-precision multiplication

[Nelson H. F. Beebe]

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
	https://mathscholar.org/2019/04/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
	https://hal.archives-ouvertes.fr/hal-02070778/document

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

-------------------------------------------------------------------------------
- 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 math.utah.edu  -
- 155 S 1400 E RM 233                       beebe at acm.org  beebe at computer.org -
- Salt Lake City, UT 84112-0090, USA    URL: http://www.math.utah.edu/~beebe/ -
-------------------------------------------------------------------------------