Fast modular composition in any characteristic

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 146-155

  Kedlaya, Kiran S ^a   Umans, Christopher ^b  

^a MIT MEDIA LAB   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY CHARACTERISTICS; BIT OPERATIONS; EFFICIENT DATA STRUCTURES; FAST METHODS; MATRIX MULTIPLICATIONS; MINIMAL POLYNOMIALS; MULTI-DIMENSIONAL; MULTIMODULAR; MULTIVARIATE POLYNOMIALS; POLYNOMIAL EVALUATIONS; RANDOMIZED ALGORITHMS; REAL PROBLEMS; RUNNING TIMES; UNIVARIATE;

ARSENIC; COMPUTERS; DATA STRUCTURES; FIBER OPTIC CHEMICAL SENSORS; FILE ORGANIZATION; POLYNOMIAL APPROXIMATION;

POLYNOMIALS;

EID: 57949111528     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.13     Document Type: Conference Paper

References (20)

1. E. G. Belaga. Evaluation of polynomials of one variable with preliminary preprocessing of the coefficients. Problemy Kibernet, 5:7-15, 1961.
2. D. J. Bernstein. Fast multiplication and its applications (version of 7 Oct 2004). Preprint available at http://cr.yp.to/papers.html#multapps.
3. A. Bostan, G. Lecerf, and E. Schost. Tellegen's principle into practice. In ISSAC, pages 37-44, 2003.
4. R. P. Brent and H. T. Kung. Fast algorithms for manipulating formal power series. J. ACM, 25(4):581-595, 1978.
5. P. Bürgisser, M. Clausen, and M. A. Shokrollahi. Algebraic Complexity Theory, volume 315 of Grundlehren der mathematischen Wissenschaften. Springer-Verlag, 1997.
6. A. Gal and P. B. Miltersen. The cell probe complexity of succinct data structures. Theor. Comput. Sci., 379(3):405-417, 2007.
7. X. Huang and V. Y. Pan. Fast rectangular matrix multiplication and applications. J. Complexity, 14(2):257-299, 1998.
8. H. Hubrechts. Point counting in families of hyperelliptic curves (version of 31 Mar 2007). Preprint available at http://wis.kuleuven.be/algebra/ hubrechts/.
9. E. Kaltofen and V. Shoup. Subquadratic-time factoring of polynomials over finite fields. Mathematics of Computation, 67(223): 1179-1197, 1998.
10. P. B. Miltersen. On the cell probe complexity of polynomial evaluation. Theor. Comput. Sci., 143(1): 167-174, 1995.
11. M. Nüsken and M. Ziegler. Fast multipoint evaluation of bivariate polynomials. In ESA, pages 544-555, 2004.
12. V. Y. Pan. Methods of computing values of polynomials. Russian Math. Surveys, 21(1):105-136, 1966.
13. M. O. Rabin. Probabilistic algorithms in finite fields. SIAM J. Comput, 9(2):273-280, 1980.
14. V. Shoup. NTL 5.4.2. Available at http://www.shoup.net/ntl/.
15. V. Shoup. Fast construction of irreducible polynomials over finite fields. J. Symb. Comput., 17(5):371-391, 1994.
16. V. Shoup. Efficient computation of minimal polynomials in algebraic extensions of finite fields. In ISSAC, pages 53-58, 1999.
17. V. Shoup. A Computational Introduction to Number Theory and Algebra (version 2.3). Cambridge University Press, 2008. Available at http://www.shoup.net/ntb/.
18. C. Umans. Fast polynomial factorization and modular composition in small characteristic. In STOC, pages 481-490, 2008.
19. J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 1999.
20. J. von zur Gathen and V. Shoup. Computing Frobenius maps and factoring polynomials. Computational Complexity, 2:187-224, 1992.