We show that deciding square-freeness of a sparse univariatepolynomial over the integer and over the algebraic closure of a finite field is NP-hard. We also discuss some related openproblems about sparse polynomials.