LISP and Symbolic Computation, 4(2)155-164
Endpaper: FRPOLY: A Benchmark RevisitedRichard J. Fateman, Computer Science Division, EECS, 571 Evans Hall, University of Berkeley, Berkeley, CA 94720
| 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? |
[local copy]