# What is the difference between \$SIZE(n^k)\$ and \$P/poly\$?

$$SIZE(n^k)$$ is defined as the class of problems solvable with Boolean circuits (of fan-in two) with $$O(n^k)$$ gates. While $$P/poly$$ is defined as those problems over {0,1}* which can be solved by an infinite family of polynomial-size circuits $${Cn}$$.