Finding irreducible polynomials over finite fields

  • Authors:
  • L M Adleman;H W Lenstra

  • Affiliations:
  • Dept. of Computer Science, University of Southern California;Mathematisch Instituut, Universiteit van Amsterdam and Mathematical Sciences Research Institute

  • Venue:
  • STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
  • Year:
  • 1986

Quantified Score

Hi-index 0.00

Visualization

Abstract