Factoring high-degree polynomials by the black box Berlekamp algorithm
Erich Kaltofen, Austin A. Lobo · 1994
Article Free Access Share on Factoring high-degree polynomials by the black box Berlekamp algorithm Authors: Erich Kaltofen Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New York Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New YorkView Profile , Austin Lobo 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 '94: Proceedings of the international symposium on Symbolic and algebraic computationAugust 1994 Pages 90–98https://doi.org/10.1145/190347.190371Published:01 August 1994Publication History 14citation740DownloadsMetricsTotal Citations14Total Downloads740Last 12 Months22Last 6 weeks3 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