Title: On computing greatest common divisors with polynomials given by black boxes for their evaluations
Abstract: Article On computing greatest common divisors with polynomials given by black boxes for their evaluations Share on Authors: Angel Díaz Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New York Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New YorkView Profile , Erich Kaltofen Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New York Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New YorkView Profile Authors Info & Claims ISSAC '95: Proceedings of the 1995 international symposium on Symbolic and algebraic computationApril 1995 Pages 232–239https://doi.org/10.1145/220346.220375Online:01 April 1995Publication History 11citation268DownloadsMetricsTotal Citations11Total Downloads268Last 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
Publication Year: 1995
Publication Date: 1995-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 22
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot