A constructive proof presenting languages in $\Sigma_2^P$ that cannot be decided by circuit families of size $n^k$

TL;DR

This paper provides the first constructive proof that for any fixed k, there exists a language in ^P that cannot be decided by circuit families of size n^k, advancing understanding of computational complexity boundaries.

Contribution

It introduces a constructive method to demonstrate languages in ^P that defy simulation by small circuit families, improving upon previous non-constructive proofs.

Findings

Constructed languages ^P not decidable by circuits of size n^k.

Method based on languages derived from satisfiability and alternating Turing machines.

First explicit construction of such languages in this complexity class.

Abstract

As far as I know, at the time that I originally devised this result (1998), this was the first constructive proof that, for any integer $k$, there is a language in $\Sigma_2^P$ that cannot be simulated by a family of logic circuits of size $n^k$. However, this result had previously been proved non-constructively: see Cai and Watanabe [CW08] for more information on the history of this problem. This constructive proof is based upon constructing a language $\Gamma$ derived from the satisfiabiility problem, and a language $\Lambda_k$ defined by an alternating Turing machine. We show that the union of $\Gamma$ and $\Lambda_k$ cannot be simulated by circuits of size $n^k$.