The complexity class $\mathbf{VP}$ (Valiant P) is defined to be the class of all polynomials of polynomially bounded degree which can be realized by an arithmetic circuit family with polynomially bounded size.
My questions are:
- Why do we require the degree to be polynomially bounded?
- Which complexity class to we get if we omit this constraint?