Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Abstracts

Abstracts 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 http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGSAM Bulletin Association for Computing Machinery

Loading next page...
 
/lp/association-for-computing-machinery/abstracts-EbNa36QPsz

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1977 by ACM Inc.
ISSN
0163-5824
DOI
10.1145/1088233.1088234
Publisher site
See Article on Publisher Site

Abstract

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

Journal

ACM SIGSAM BulletinAssociation for Computing Machinery

Published: Feb 1, 1977

There are no references for this article.