The mpfrcx library, developed in C by A. Enge, implements the arithmetic of univariate polynomials with floating point coefficients of arbitrary precision, be they real (mpfr ) or complex (mpc ). Version 0.2 was published in May 2009, and is available at http://www.multiprecision.org/mpfrcx . Advanced asymptotically fast algorithms have been implemented, such as Karatsuba and Toom–Cook multiplication, various flavours of the FFT and division with remainder by Newton iteration. Special algorithms for symbolic computation, such as fast multievaluation, are also available.
Publishing mpfrcx is part of an ongoing effort to make A. Enge's program for building elliptic curves with complex multiplication available. This program is a very important building block for cryptographic purposes as well as for primality proving (fastECPP).