It is well known that any Linear Threshold Function, $f$,
on $\{ 0, 1\}^n$ has a representation with
integer coefficients with $O(n \log n)$ bits.
We study the problem of finding a small representation
in polynomial time. Given a representation of $f$
with arbitrary size coefficients, we give a polynomial
time algorithm that finds a representation with integer
weights with $O(n^2)$ bits.