Karp–Lipton theorem

Known as: Kannan's theorem, Karp-Lipton theorem 
In complexity theory, the Karp–Lipton theorem states that if the Boolean satisfiability problem (SAT) can be solved by Boolean circuits with a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2001-2017
012320012017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
In the previous lecture, we discussed the notion of advice, and proved some results about how helpful it could be in solving… (More)
Is this relevant?
2014
2014
We explore relationships between circuit complexity, the complexity of generating circuits, and algorithms for analyzing circuits… (More)
Is this relevant?
2013
2013
We explore relationships between circuit complexity, the complexity of generating circuits, and algorithms for analyzing circuits… (More)
Is this relevant?
2012
2012
The polynomial hierarchy plays a central role in classical complexity theory. Here, we define a quantum generalization of the… (More)
Is this relevant?
2011
2011
We define and study a new notion of “robust simulations” between complexity classes which is intermediate between the traditional… (More)
Is this relevant?
2009
2009
for all x, y ∈ X. Kannan 1 proved that if X is complete, then every Kannan mapping has a fixed point. It is interesting that… (More)
  • figure 1
Is this relevant?
2007
2007
  • A. Pavana, Alan L. Selmanb, Samik Senguptab, N. V. Vinodchandranc
  • 2007
If every language in coNP has a constant-round interactive proof system, then the polynomial-time hierarchy collapses [R.B… (More)
Is this relevant?
2004
2004
Variants of Kannan’s Theorem are given where the circuits of the original theorem are replaced by arbitrary recursively… (More)
Is this relevant?
2004
2004
It is known [BHZ87] that if every language in coNP has a constant-round interactive proof system, then the polynomial hierarchy… (More)
Is this relevant?
2004
2004
It is known (Boppana et a;., 1987) that if every language in coNP has a constant-round interactive proof system, then the… (More)
Is this relevant?