Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Karp–Lipton_theorem> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Karp–Lipton_theorem abstract "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 and therefore 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 , but Michael Sipser improved it to .)Variants of the theorem state that, under the same assumption, MA = AM, and PH collapses to SP2 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. If coNP is assumed to be subset of NP/poly, then the polynomial hierarchy collapses to its third level.".
- Karp–Lipton_theorem wikiPageID "2855729".
- Karp–Lipton_theorem wikiPageRevisionID "572023351".
- Karp–Lipton_theorem b "2".
- Karp–Lipton_theorem p "P".
- Karp–Lipton_theorem subject Category:Theorems_in_computational_complexity_theory.
- Karp–Lipton_theorem comment "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 and therefore 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.".
- Karp–Lipton_theorem label "Karp–Lipton theorem".
- Karp–Lipton_theorem sameAs Karp%E2%80%93Lipton_theorem.
- Karp–Lipton_theorem sameAs Q6373327.
- Karp–Lipton_theorem sameAs Q6373327.
- Karp–Lipton_theorem wasDerivedFrom Karp–Lipton_theorem?oldid=572023351.