Title: On the genericity of the modular polynomial GCD algorithm
Abstract: Article Free Access Share on On the genericity of the modular polynomial GCD algorithm Authors: Erich Kaltofen North Carolina State University, Mathematics Department, Box 8205 Raleigh, N.C North Carolina State University, Mathematics Department, Box 8205 Raleigh, N.CView Profile , Michael B. Monagan Centre for Experimental and Constructive Mathematics, Simon Fraser University, Burnaby, British Columbia, V5A 1S6 Canada Centre for Experimental and Constructive Mathematics, Simon Fraser University, Burnaby, British Columbia, V5A 1S6 CanadaView Profile Authors Info & Claims ISSAC '99: Proceedings of the 1999 international symposium on Symbolic and algebraic computationJuly 1999 Pages 59–66https://doi.org/10.1145/309831.309861Online:01 July 1999Publication History 3citation312DownloadsMetricsTotal Citations3Total Downloads312Last 12 Months5Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF