SAC-1 solution of problem #7

Authors:
G. E. Collins;D. R. Musser;M. Rothstein
Affiliations:
University of Wisconsin, Madison, Wisconsin;University of Wisconsin, Madison, Wisconsin;University of Wisconsin, Madison, Wisconsin
Venue:
ACM SIGSAM Bulletin
Year:
1974

Citing 3
Cited 2

Inequalities about factors of integer polynomials

ACM SIGSAM Bulletin
Problem #7

ACM SIGSAM Bulletin
Computational aspects of Hensel-type univariate polynomial greatest common divisor algorithms

ACM SIGSAM Bulletin

Towards a REDUCE solution to SIGSAM problem 7

ACM SIGSAM Bulletin
Problem 7 and systems of algebraic equations

ACM SIGSAM Bulletin

Quantified Score

Hi-index	0.00

Visualization

Abstract

This note reports on various aspects of our experience in using the SAC-1 system to solve Problem #7, submitted by S. C. Johnson and R. L. Graham, [1]. In solving the problem, several separate SAC-1 main programs were written for the various parts of the problem. These separate programs could, in principle, have been combined into a single main program. The SAC-1 solution involved the use of seven of the ten currently released SAC-1 subsystems. With reference to Loos' bibliography, [2], the seven subsystems used were CO-12, CO-13, CO-14, CO-17, CO-15, CO-16 and CO-19; CO-18, CO-31 and CO-32 were not needed.