Login / Signup

On the number of Eisenstein polynomials of bounded height.

Randell HeymanIgor E. Shparlinski
Published in: Appl. Algebra Eng. Commun. Comput. (2013)
Keyphrases
  • small number
  • neural network
  • information retrieval
  • finite number
  • fixed number
  • data sets
  • databases
  • information systems
  • lower bound
  • user interface
  • np complete