The computational complexity of polynomial factorization May 15 to May 19, 2006 AIM Research Conference Center, Palo Alto, CA Organizers: Shuhong Gao, Mark van Hoeij, Erich Kaltofen, and Victor Shoup Workshop topics: This workshop, sponsored by AIM and the NSF, will be devoted to algorithms for factoring polynomials. Both univariate and multivariate polynomials will be considered, with coefficients from finite fields, the rationals, and the complex numbers. The goal of the workshop is to invent significantly faster new algorithms, or in turn establish hardness of a given factorization problem. Application deadline: February 15, 2006 For more information: http://aimath.org/ARCC/workshops/polyfactor.html