1 paper
Kevin G. Hare, Philip W. Hodges
We consider the integer Chebyshev problem, that of minimizing the supremum norm over polynomials with integer coefficients on the interval [0,1]. We implement algorithms from sem…