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

	Linear recurrences with polynomial coefficients and computation of the Cartier-Manin operator on hyperelliptic curves ´ Alin Bostan1 , Pierrick Gaudry2 , Eric Schost3 DocID: 1qMft - View Document
	Project 1: Part 1 Project 1 will be to calculate orthogonal polynomials. It will have several parts. Note: The scheme code in this writeup is available in the file project1.scm, available from the course web page. Warmup DocID: 1q8Ma - View Document
	JMLR: Workshop and Conference Proceedings vol 40:1–14, 2015 Variable Selection is Hard Dean P. Foster DEAN @ FOSTER . NET DocID: 1pEs6 - View Document
	Fast modular composition in any characteristic Kiran S. Kedlaya∗ MIT Christopher Umans† Caltech DocID: 1pqIx - View Document
	A fast algorithm for computing the p-curvature Alin Bostan Xavier Caruso Éric Schost DocID: 1p9lJ - View Document