Advanced
Theory of Computation
Q87 / 100
What is the Karp-Lipton theorem?
Correct! Well done.
Incorrect.
The correct answer is B) If NP ⊆ P/poly (polynomial-size circuits), then the polynomial hierarchy collapses to the second level (PH = Σ₂ᴾ)
B
Correct Answer
If NP ⊆ P/poly (polynomial-size circuits), then the polynomial hierarchy collapses to the second level (PH = Σ₂ᴾ)
Explanation
Karp-Lipton (1980): NP ⊆ P/poly → PH collapses. This is evidence against NP ⊆ P/poly, since most believe PH doesn't collapse. It connects circuit complexity to the P vs NP question.
Progress
87/100