Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
SYSTErB SAC-I System Error Announcement An error has recently been discovered in the algorithms used in SAC-I for polynomial greatest common divisor calculation. Thanks are due to Franz MUller of the University of Heidelberg for bringing the problem to my attention, and the required changes to the system have been made by Stuart C. Schaller at the University of Wisconsin. If Al and A2 are integral polynomials and then the problem occurs i f a prime B=gcd(Ai,A2) SAC-I users. However, users with immediate needs for the corrections and users who may not be known to me are urged to write to me requesting advance copies. Incidentally, the problem described above does not occur in the similar algorithm described by Brown in his a r t i c l e in JACM, 1971, pp. 478-504. The difference is that the "degree vectors" used by Brown are the exponent vectors of leading terms. The ith component of such a degree vector is not, in general, the degree of the polynomial in its i t h variable. (Consider Xl+X or x2+xl. ) We 2 are confident that Brown was aware of this, but we feel that his choice of terminology was
ACM SIGSAM Bulletin – Association for Computing Machinery
Published: Feb 1, 1977
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.