Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

On determining whether two polynomials are relatively prime

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Cullen, C. ; University of Pittsburgh, Pittsburgh, PA, USA ; Hall, C.

A comparison is made of the computational effort required for four different algorithms which establish whether two monic polynomials have a common zero. Two of the algorithms are based on the vanishing of the resultant and the other two on a recent theorem of Vogt and Bose.

Published in:

Automatic Control, IEEE Transactions on  (Volume:16 ,  Issue: 4 )