Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
106
Voted
ISSAC
1999
Springer
116
views
Mathematics
»
more
ISSAC 1999
»
On the Genericity of the Modular Polynomial GCD Algorithm
15 years 7 months ago
Download
www4.ncsu.edu
In this paper we study the generic setting of the modular GCD algorithm. We develop the algorithm for multivariate polynomials over Euclidean domains which have a special kind of ...
Erich Kaltofen, Michael B. Monagan
claim paper
Read More »