Login / Signup

Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots.

Markus A. HitzErich Kaltofen
Published in: ISSAC (1998)
Keyphrases
  • efficient algorithms for computing
  • nearest neighbor
  • potential functions
  • database
  • euclidean distance
  • maximum entropy
  • lower bound
  • low order