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

	Cryptography, homework sheet 5 Due for 2MMC10: 12 October 2017, 10:45 and for Mastermath: 23 November 2017, 10:45 by email to You may use computer algebra systems such as mathematica, gp, or sage or DocID: 1vn9V - View Document
	The vibrational spectrum of Buckminsterfullerene An application of symmetry reduction and computer algebra Joris Mooij Master’s Thesis in Mathematics DocID: 1vjmN - View Document
	Computer Algebra Tailored to Matrix Inequalities in Control M. C. de Oliveira and J. William Helton ∗ † DocID: 1vecp - View Document
	Transferring Skills at Solving Word Problems from Computing to Algebra Through Bootstrap Emmanuel Schanzer, Kathi Fisler, Shriram Krishnamurthi, Matthias Felleisen Harvard Graduate School of Education, WPI Computer Scien DocID: 1ve3R - View Document
	American Computer Science League Flyer Solutions 1. Boolean Algebra ( A  B) ( AB  BC ) = A B ( AB  BC ) = AA B  A BB C  0  0  0 DocID: 1uZJ8 - View Document