Searching techniques for integral tables

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Searching techniques for integral tables

Full text

Pdf (892 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1995 international symposium on Symbolic and algebraic computation table of contents

Montreal, Quebec, Canada

Pages: 133 - 139

Year of Publication: 1995

ISBN:0-89791-699-9

Authors

T. H. Einwohner	Computer Science Division, EECS Department, University of California at Berkeley
Richard J. Fateman	Computer Science Division, EECS Department, University of California at Berkeley

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 10, Downloads (12 Months): 22, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/220346.220364 What is a DOI?

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.

	1	Benjamin P. Berman , Richard J. Fateman, Optical character recognition for typeset mathematics, Proceedings of the international symposium on Symbolic and algebraic computation, p.348-353, July 20-22, 1994, Oxford, United Kingdom [doi>10.1145/190347.190438]
	2	Adam Dingle , Richard J. Fateman, Branch cuts in computer algebra, Proceedings of the international symposium on Symbolic and algebraic computation, p.250-257, July 20-22, 1994, Oxford, United Kingdom [doi>10.1145/190347.190424]
	3	Keith O. Geddes , Stephen R. Czapor , George Labahn, Algorithms for computer algebra, Kluwer Academic Publishers, Norwell, MA, 1992
	4	Gradshteyn, I.S. and I.M. Ryzhik. Table of Integrals, Series, and Products, (4th Corrected and Enlarged ed.) Academic Press 1980.
	5	Peter Norvig, Paradigms of Artificial Intelligence Programming: Case Studies in Common Lisp, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1992
	6	A. P. Prudnikov , Yu A. Bryčkov , O. I. Maričev, Integrals and series of special functions, Science, Moscow, Russia, 1983
	7	Guy L. Steele, Jr., Common LISP: the language (2nd ed.), Digital Press, Newton, MA, 1990

CITED BY 3

	Richard J. Fateman, Network servers for symbolic mathematics, Proceedings of the 1997 international symposium on Symbolic and algebraic computation, p.249-256, July 21-23, 1997, Kihei, Maui, Hawaii, United States
	A. A. Adams , H. Gottliebsen , S. A. Linton , U. Martin, Automated theorem proving in support of computer algebra: symbolic definite integration as a case study, Proceedings of the 1999 international symposium on Symbolic and algebraic computation, p.253-260, July 28-31, 1999, Vancouver, British Columbia, Canada
	Albert D. Rich , David J. Jeffrey, Efficiency considerations for indefinite integration by transformation rules, Proceedings of the 9th WSEAS International Conference on Systems Theory and Scientific Computation, p.163-168, August 20-22, 2009, Moscow, Russia