Solving Kaltofen's challenge on Zolotarev's approximation problem

@inproceedings{Lazard2006SolvingKC,
  title={Solving Kaltofen's challenge on Zolotarev's approximation problem},
  author={Daniel Lazard},
  booktitle={ISSAC},
  year={2006}
}
Zolotarev's Approximation problem consists in finding the best approximation of a polynomial of degree n by a polynomial of degree n−2 in the interval [−1, 1]. It is solved for n ≤ 12 by replacing CAD (Cylindrical Algebraic Decomposition) by a strategy consisting in computing first the Zariski closure of the semi-algebraic set which is looked for, before managing the inequalities. 

Similar Papers

References

Publications referenced by this paper.
SHOWING 1-3 OF 3 REFERENCES

Challenges of Symbolic Computation: My Favorite Open Problems

  • J. Symb. Comput.
  • 2000
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Application of Quantifier Elimination to Solotareff’s Approximation Problem

George E. Collins
  • Technical Report 95-31,
  • 1995
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL