Under the auspices of the Computational Complexity Foundation (CCF)
In this short note we show that for any integer k, there arelanguages in the complexity class PP that do not have Booleancircuits of size $n^k$.
