Abstract: A number of classical and not so classical problems in number theory concern finding polynomials with integer coefficients that are of small norm. These include some old chestnuts like the Tarry-Escott problem and Littlewood's (other) Conjecture. Closely related questions on the maximal vanishing of small height polynomials are also discussed. All of these problems lend themselves to computational exploration.