ACM Home Page
Please provide us with feedback. Feedback
Lookup tables, recurrences and complexity
Full text PdfPdf (612 KB)
Source International Conference on Symbolic and Algebraic Computation archive
Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation table of contents
Portland, Oregon, United States
Pages: 68 - 73  
Year of Publication: 1989
ISBN:0-89791-325-6
Author
R. J. Fateman  University of California, Berkeley
Sponsor
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 30,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/74540.74549
What is a DOI?

ABSTRACT

The use of lookup tables can reduce the complexity of calculation of functions defined typically by mathematical recurrence relations. Although this technique has been adopted by several algebraic manipulation systems, it has not been examined critically in the literature. While the use of tabulation or “memoization” seems to be a particularly simple and worthwhile technique in some areas, there are some negative consequences. Furthermore, the expansion of this technique to other areas (other than recurrences) has not been subjected to analysis. This paper examines some of the assumptions. A more detailed technical report [9] is under preparation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
2
 
3
Bruce Char et al. On the Design and Performance of the Maple System. Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, CS-84-13, 1989.
 
4
Richard Fateman. Macsyma's General Simplifier: Philosophy and Operation. In Lewis, V.E. (ed), Proceedings of the 1979 Macsyma Users Conference. Washington D.C., 1979. 563-582.
 
5
 
6
 
7
J. C. P. Miller and Brown, D. J. S. An algorithm for evaluation of remote terms in a linear recurrence sequence, Comp. J. 9 (1966), 188-190.
 
8
Michael B. Monagan, private communication.
 
9
 
10