Course outline-Reference-Cited by-同舟云学术

Course outline

Published:1975-08 Issue:3 Volume:9 Page:9-10
ISSN:0163-5824
Container-title:ACM SIGSAM Bulletin
language:en
Short-container-title:SIGSAM Bull.

Author:

Jenks Richard D.

Abstract

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.

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/1088309.1088311

Reference18 articles.

1. An Irreducibility Criterion for Polynomials Over the Integers

2. On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors

3. B. F. Caviness "On Canonical Forms and Simplification" JACM Vol 17 No. 2 (April 1970) pp. 385--396. 10.1145/321574.321591 B. F. Caviness "On Canonical Forms and Simplification" JACM Vol 17 No. 2 (April 1970) pp. 385--396. 10.1145/321574.321591

4. R. J. Fateman "Essays in Algebraic Simplification" Report MAC TR-95 Project MAC M.I.T. Cambridge Mass. (April 1972). R. J. Fateman "Essays in Algebraic Simplification" Report MAC TR-95 Project MAC M.I.T. Cambridge Mass. (April 1972).

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computer Algebra Systems;Computing Supplementa;1983

2. Computer Algebra Systems;Computing Supplementum;1982

3. Symbolic mathematical computation;ACM SIGSAM Bulletin;1976-05