P

Initializing...

Theorem 1.2: depth-$h$ circuits for $k$-Clique need $n^{\Omega(k)}$ gates for $3\le k\le n^{1/(h-1)-\varepsilon}$ and $n^{(1/4-o(1))k}$ gates for $k=n^{o(1)}$ · Prove2Me