Back to Results
First PageMeta Content
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

Document Date: 2008-08-04 00:47:22


Open Document

File Size: 244,44 KB

Share Result on Facebook
UPDATE