Fast modular composition in any characteristic Kiran S. Kedlaya∗ MIT Christopher Umans† Caltech

First Page		Document Content
Date: 2008-08-04 00:47:22 Computer algebra Computational complexity theory Polynomials Algebra Factorization of polynomials Polynomial Time complexity Reduction Polynomial greatest common divisor Factorization of polynomials over finite fields		Fast modular composition in any characteristic Kiran S. Kedlaya∗ MIT Christopher Umans† Caltech Add to Reading List Source URL: users.cms.caltech.edu Download Document from Source Website File Size: 244,44 KB Share Document on Facebook

	Fast polynomial factorization, modular composition, and multipoint evaluation of multivariate polynomials in small characteristic Christopher Umans∗ Computer Science Department California Institute of Technology DocID: 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 Ge DocID: 1r7T9 - View Document
	Primary decomposition of zero-dimensional ideals: Putting Monico’s algorithm into practice extended abstract † DocID: 1r2Hp - View Document
	doi:j.jnt DocID: 1qIei - View Document