First Page | Document Content | |
---|---|---|
Date: 2008-08-04 00:47:22Computer 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† CaltechAdd to Reading ListSource URL: users.cms.caltech.eduDownload Document from Source WebsiteFile Size: 244,44 KBShare Document on Facebook |