In this paper, it is shown that the Hilbert series of a Borel type ideal may be computed within a complexity which is polynomial in $D^n$ where $n + 1$ is the number of unknowns and $D$ is the highest degree of a minimal generator of input (monomial) ideal.