# 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} }

- Published in ISSAC 2006
DOI:10.1145/1145768.1145803

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.

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-9 OF 9 CITATIONS

## An explicit univariate and radical parametrization of the sextic proper Zolotarev polynomials.

VIEW 2 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## An Algebraic-Geometric Method for Computing Zolotarev Polynomials

VIEW 1 EXCERPT

CITES BACKGROUND

## Computation with semialgebraic sets represented by cylindrical algebraic formulas

VIEW 1 EXCERPT

CITES BACKGROUND

## Team salsa Solvers for ALgebraic Systems and Applications

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-3 OF 3 REFERENCES

## Challenges of Symbolic Computation: My Favorite Open Problems

VIEW 10 EXCERPTS

HIGHLY INFLUENTIAL

## Application of Quantifier Elimination to Solotareff’s Approximation Problem

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## Theory of approximation

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL