<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2013-07-15 15:20:39Abstract algebra Algebra Root-finding algorithms Computational complexity theory Fast Fourier transform Durand–Kerner method Factorization of polynomials Time complexity System of polynomial equations Mathematics Polynomials Theoretical computer science |
| Fast polynomial factorization, modular composition, and multipoint evaluation of multivariate polynomials in small characteristic Christopher Umans∗ Computer Science Department California Institute of TechnologyDocID: 1rDyf - View Document |
| A Characterization of Semisimple Plane Polynomial Automorphisms. Jean-Philippe FURTER, Dpt. of Math., Univ. of La Rochelle, av. M. Crépeau, La Rochelle, FRANCE email:DocID: 1raZ0 - View Document |
| New Algorithms for Learning in Presence of Errors∗ Sanjeev Arora Rong GeDocID: 1r7T9 - View Document |
| Primary decomposition of zero-dimensional ideals: Putting Monico’s algorithm into practice extended abstract †DocID: 1r2Hp - View Document |
| doi:j.jntDocID: 1qIei - View Document |