Karp–Lipton theorem

From Wikipedia, the free encyclopedia
  (Redirected from Karp-Lipton theorem)
Jump to: navigation, search
The notation used in this article is explained on the page polynomial hierarchy.

In complexity theory, the Karp–Lipton theorem states that if the boolean satisfiability problem (SAT) can be solved by Boolean circuits with a polynomial number of logic gates, then

\Pi_2 = \Sigma_2 \, and therefore \mathrm{PH} = \Sigma_2. \,

That is, if we assume that NP, the class of nondeterministic polynomial time problems, can be contained in the non-uniform polynomial time complexity class P/poly, then this assumption implies the collapse of the polynomial hierarchy at its second level. Such a collapse is believed unlikely, so the theorem is generally viewed by complexity theorists as evidence for the nonexistence of polynomial size circuits for SAT or for other NP-complete problems. A proof that such circuits do not exist would imply that P ≠ NP. As P/poly contains all problems solvable in randomized polynomial time (Adleman's theorem), the Karp–Lipton theorem is also evidence that the use of randomization does not lead to polynomial time algorithms for NP-complete problems.

The Karp–Lipton theorem is named after Richard M. Karp and Richard J. Lipton, who first proved it in 1980. (Their original proof collapsed PH to \Sigma_3, but Michael Sipser improved it to \Sigma_2.)

Variants of the theorem state that, under the same assumption, MA = AM, and PH collapses to SP
2
complexity class. There are stronger conclusions possible if PSPACE, or some other complexity classes are assumed to have polynomial-sized circuits; see P/poly. If NP is assumed to be a subset of BPP (which is a subset of P/poly), then the polynomial hierarchy collapses to BPP.[1] If coNP is assumed to be subset of NP/poly, then the polynomial hierarchy collapses to its third level.

Intuition[edit]

Suppose that polynomial sized circuits for SAT not only exist, but also that they could be constructed by a polynomial time algorithm. Then this supposition implies that SAT itself could be solved by a polynomial time algorithm that constructs the circuit and then applies it. That is, efficiently constructible circuits for SAT would lead to a stronger collapse, P = NP.

The assumption of the Karp–Lipton theorem, that these circuits exist, is weaker. But it is still possible for an algorithm in the complexity class \Sigma_2 to guess a correct circuit for SAT. The complexity class \Sigma_2 describes problems of the form

\exists x\forall y\;\psi(x,y)

where \psi is any polynomial-time computable predicate. The existential power of the first quantifier in this predicate can be used to guess a correct circuit for SAT, and the universal power of the second quantifier can be used to verify that the circuit is correct. Once this circuit is guessed and verified, the algorithm in class \Sigma_2 can use it as a subroutine for solving other problems.

Self-reducibility[edit]

To understand the Karp–Lipton proof in more detail, we consider the problem of testing whether a circuit c is a correct circuit for solving SAT instances of a given size, and show that this circuit testing problem belongs to \Pi_1. That is, there exists a polynomial time computable predicate V such that c is a correct circuit if and only if, for all polynomially-bounded z, V(c,z) is true.

The circuit c is a correct circuit for SAT if it satisfies two properties:

  • For every pair (s,x) where s is an instance of SAT and x is a solution to the instance, c(s) must be true
  • For every instance s of SAT for which c(s) is true, s must be solvable.

The first of these two properties is already in the form of problems in class \Pi_1. To verify the second property, we use the self-reducibility property of SAT.

Self-reducibility describes the phenomenon that, if we can quickly test whether a SAT instance is solvable, we can almost as quickly find an explicit solution to the instance. To find a solution to an instance s, choose one of the Boolean variables x that is input to s, and make two smaller instances s0 and s1 where si denotes the formula formed by replacing x with the constant i. Once these two smaller instances have been constructed, apply the test for solvability to each of them. If one of these two tests returns that the smaller instance is satisfiable, continue solving that instance until a complete solution has been derived.

To use self-reducibility to check the second property of a correct circuit for SAT, we rewrite it as follows:

  • For every instance s of SAT for which c(s) is true, the self-reduction procedure described above finds a valid solution to s.

Thus, we can test in \Pi_1 whether c is a valid circuit for solving SAT.

see Random self-reducibility for more information

Proof of Karp–Lipton theorem[edit]

The Karp–Lipton theorem can be restated as a result about Boolean formulas with polynomially-bounded quantifiers. Problems in \Pi_2 are described by formulas of this type, with the syntax

\phi = \forall x \exists y \; \psi(x, y)

where \psi is a polynomial-time computable predicate. The Karp–Lipton theorem states that this type of formula can be transformed in polynomial time into an equivalent formula in which the quantifiers appear in the opposite order; such a formula belongs to \Sigma_2. Note that the subformula

s(x)=\exists y \; \psi(x, y)

is an instance of SAT. That is, if c is a valid circuit for SAT, then this subformula is equivalent to the unquantified formula c(s(x)). Therefore, the full formula for \phi is equivalent (under the assumption that a valid circuit c exists) to the formula

\exists c\forall (x,z)\;V(c,z)\wedge c(s(x)) \,

where V is the formula used to verify that c really is a valid circuit using self-reducibility, as described above. This equivalent formula has its quantifiers in the opposite order, as desired. Therefore, the Karp–Lipton assumption allows us to transpose the order of existential and universal quantifiers in formulas of this type, showing that \Sigma_2=\Pi_2. Repeating the transposition allows formulas with deeper nesting to be simplified to a form in which they have a single existential quantifier followed by a single universal quantifier, showing that PH=\Sigma_2.

Another proof and S2P[edit]

Assume \mathsf{NP} \subseteq \mathsf{P/poly}. Thefore, there exists a family of circuits C_n that solves satisfability on input of length n. Using self-reducibility, there exists a family of circuits D_n which outputs a satisfying assignment on true instances.

Suppose L is a \Pi_2 set

L = \{z : \forall x. \exists y. \phi(x,y,z)\} \,

Since \exists y. \phi(x,y,z) can be considered an instance of SAT (by Cook-Levin theorem), there exists a circuit D_n, depending on n = |z|, such that the formula defining L is equivalent to

\forall x. \phi(x, D_n(x, z), z)

 

 

 

 

(1)

Furthermore, the circuit can be guessed with existential quantification:

\exists D. \forall x. \phi(x, D(x, z), z)

 

 

 

 

(2)

Obviously (1) implies (2). If (1) is false, then \neg \exists y. \phi(x,y,z). In this case, no circuit D can output an assignment making \phi(x, D(x, z), z)\; true.

The proof has shown that a \Pi_2 set L is in \Sigma_2.

What more, if the \Pi_2 formula is true, then the circuit D will work against any x. If the \Pi_2 formula is false, then x making the formula (1) false will work against any circuit. This property means a stronger collapse, namely to SP
2
complexity class (i.e. \Pi_2 \subseteq \mathsf{S}_2^P \subseteq \Sigma_2). It was observed by Sengupta.[2]

AM = MA[edit]

A modification[3] of the above proof yields

\mathsf{NP} \subseteq \mathsf{P/poly} \implies \mathsf{AM} = \mathsf{MA}

(see Arthur–Merlin protocol).

Suppose that L is in AM, i.e.:

z \in L \implies \Pr\nolimits_x[\exists y. \phi(x,y,z)] \geq \tfrac{2}{3}
z \notin L \implies \Pr\nolimits_x[\exists y. \phi(x,y,z)] \leq \tfrac{1}{3}

and as previously rewrite \exists y. \phi(x,y,z) using the circuit D_n that outputs a satisfying assignment if it exists:

z \in L \implies \Pr\nolimits_x[\phi(x,D_n(x,z),z)] \geq \tfrac{2}{3}
z \notin L \implies \Pr\nolimits_x[\phi(x,D_n(x,z),z)] \leq \tfrac{1}{3}

Since D_n can be guessed:

z \in L \implies \exists D. \Pr\nolimits_x[\phi(x,D(x,z),z)] \geq \tfrac{2}{3}
z \notin L \implies \forall D. \Pr\nolimits_x[\phi(x,D(x,z),z)] \leq \tfrac{1}{3}

which proves L is in the smaller class MA.

Application to circuit lower bounds – Kannan's theorem[edit]

Kannan's theorem[4] states that for any fixed k there exists a language L in \Sigma_2, which is not in SIZE(nk) (This is a different statement than \Sigma_2 \not \subseteq \mathsf{P/poly}, which is currently open and states that there exists a single language that is not in SIZE(nk) for any k). It is a simple circuit lower bound.

Proof outline:

There exists a language L \in \Sigma_4 - \mathsf{SIZE}(n^k) (the proof uses diagonalization technique). Consider two cases:

  • If \mathsf{SAT} \notin \mathsf{P/poly} then \mathsf{SAT} \notin \mathsf{SIZE}(n^k) and theorem is proved.
  • If \mathsf{SAT} \in \mathsf{P/poly}, then by Karp–Lipton theorem, \Sigma_4 = \Sigma_2 and therefore L \in \Sigma_2 - \mathsf{SIZE}(n^k).

A stronger version of Karp–Lipton theorem strengthens Kannan's theorem to: for any k, there exists a language L \in \mathsf{S}_2^P - \mathsf{SIZE}(n^k).

It is also known that PP is not contained in \mathsf{SIZE}(n^k), which was proved by Vinodchandran.[5] Proof:[6]

  • If \mathsf{PP} \not \subseteq \mathsf{P/poly} then \mathsf{PP} \not \subseteq \mathsf{SIZE}(n^k).
  • Otherwise, \mathsf{P^{\sharp P}} \subseteq \mathsf{P/poly}. Since
\mathsf{P^{\sharp P}} \supseteq \mathsf{PP} \supseteq \mathsf{MA} (by property of MA)
\mathsf{P^{\sharp P}} \supseteq \mathsf{PH} \supseteq \Sigma_2 \supseteq \mathsf{MA} (by Toda's theorem and property of MA)
\mathsf{P^{\sharp P}} = \mathsf{MA} (follows from assumption using interactive protocol for permanent, see P/poly)
the containments are equalities and we get \mathsf{PP} = \Sigma_2 \not \subseteq \mathsf{SIZE}(n^k) by Kannan's theorem.

References[edit]

  1. ^ S. Zachos, Probabilistic quantifiers and games, 1988
  2. ^ Jin Yi-Cai. S_2^P \subseteq \mathsf{ZPP}^{\mathsf{NP}} [1], section 6
  3. ^ V. Arvind, J. Köbler, U. Schöning, R. Schuler, If NP has Polynomial-Size Circuits, then MA = AM
  4. ^ Kannan, R. (1982). "Circuit-size lower bounds and non-reducibility to sparse sets". Information and Control 55: 40–56. doi:10.1016/S0019-9958(82)90382-5. 
  5. ^ N. V. Vinodchandran, A note on the circuit complexity of PP
  6. ^ S. Aaronson, Oracles Are Subtle But Not Malicious