The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
On Canonical Forms and Simplification
Journal of the ACM (JACM)
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
Journal of the ACM (JACM)
Algebraic simplification: a guide for the perplexed
Communications of the ACM
Symbolic integration: the stormy decade
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
ACM '73 Proceedings of the ACM annual conference
On the use of syntax-based translators for symbolic and algebraic manipulation
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
ESSAYS IN ALGEBRAIC SIMPLIFICATION
ESSAYS IN ALGEBRAIC SIMPLIFICATION
Symbolic mathematical computation: a survey
ACM SIGSAM Bulletin
| Hi-index | 0.00 |
The following is an outline of a course entitled "Introduction to Symbolic Mathematical Computation", offered by the Computer Science Department at Yale University in the Spring semester 1975. The course consisted of some 15 lectures, 1-1/2 to 2 hours in duration as outlined below. The three lectures entitled "Hensel's Lemma and Algorithm Applications" were given by David Yun. The course was taught principally as a seminar with most of the grade based on a rather tough final given below.