Article thumbnail

On the genericity of the modular polynomial GCD algorithm

By Erich Kaltofen and Michael B. Monagan
Publisher: 'Association for Computing Machinery (ACM)'
Year: 2003
DOI identifier: 10.1145/309831.309861
OAI identifier:
Provided by: MUCC (Crossref)
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www4.ncsu.edu/~kaltofen... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.