Endpaper: FRPOLY: A benchmark revisited |
| |
| Authors: | Richard J Fateman |
| |
| Affiliation: | (1) Computer Science Division, EECS, University of Berkeley, 571 Evans Hall, 94720 Berkeley, CA |
| |
| Abstract: | The FRPOLY Lisp performance benchmark 3] was based on a circa-1968 piece of code for computing powers of polynomials. We address two questions: (a) What algorithm would you use if you really wanted to compute powers of polynomials fast? and (b) Given that Common Lisp supports many types of data structures other than the simple lists used for the benchmark, what more efficient representations might be appropriate to use for polynomials? |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
