SAC-1 solution of problem #7
- 1 May 1974
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGSAM Bulletin
- Vol. 8 (2) , 17-19
- https://doi.org/10.1145/1086830.1086833
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.Keywords
This publication has 3 references indexed in Scilit:
- Inequalities about factors of integer polynomialsACM SIGSAM Bulletin, 1987
- Computational aspects of Hensel-type univariate polynomial greatest common divisor algorithmsACM SIGSAM Bulletin, 1974
- Problem #7ACM SIGSAM Bulletin, 1974