The modulo N extended GCD problem for polynomials
Thom Mulders, Arne Storjohann · 1998
Article The modulo N extended GCD problem for polynomials Share on Authors: Thom Mulders Institute of Scientific Computing, ETH Zurich, Switzerland Institute of Scientific Computing, ETH Zurich, SwitzerlandView Profile , Arne Storjohann Institute of Scientific Computing, ETH Zurich, Switzerland Institute of Scientific Computing, ETH Zurich, SwitzerlandView Profile Authors Info & Claims ISSAC '98: Proceedings of the 1998 international symposium on Symbolic and algebraic computationAugust 1998 Pages 105–112https://doi.org/10.1145/281508.281586Online:01 August 1998Publication History 0citation254DownloadsMetricsTotal Citations0Total Downloads254Last 12 Months3Last 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 SiteGet Access