Finding irreducible polynomials over finite fields
Leonard M. Adleman, Hendrik W. Lenstra · 1986
Article Free Access Share on Finding irreducible polynomials over finite fields Authors: L M Adleman Dept. of Computer Science, University of Southern California Dept. of Computer Science, University of Southern CaliforniaView Profile , H W Lenstra Mathematisch Instituut, Universiteit van Amsterdam and Mathematical Sciences Research Institute Mathematisch Instituut, Universiteit van Amsterdam and Mathematical Sciences Research InstituteView Profile Authors Info & Claims STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computingNovember 1986 Pages 350–355https://doi.org/10.1145/12130.12166Online:01 November 1986Publication History 51citation1,338DownloadsMetricsTotal Citations51Total Downloads1,338Last 12 Months31Last 6 weeks9 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