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

	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
	doi:j.jnt DocID: 1qIei - View Document
	Interpolation of polynomials given by straight-line programs ´ Sanchit Garg a Eric Schost b a India DocID: 1qfxY - View Document
	Fast Computation of Special Resultants ´ Alin Bostan a Philippe Flajolet a Bruno Salvy a Eric Schost b a Algorithms DocID: 1pK4i - View Document