Arjun Suresh (talk | contribs) |
Arjun Suresh (talk | contribs) |
||
Line 2: | Line 2: | ||
$P \subseteq NP \subseteq NPC \subseteq NPH$ | $P \subseteq NP \subseteq NPC \subseteq NPH$ | ||
− | *If | + | |
− | *If | + | Consider problems $A$ and $B$ |
− | *If | + | *If <math>A</math> is reduced to <math>B</math> and <math>B</math> $\in$ P, then <math>A</math> $\in$ <math>P</math> |
− | *If | + | *If <math>A</math> is reduced to <math>B</math> and <math>B</math> $\in$ NP, then <math>A</math> $\in$ <math>NP</math> (<math>B</math> may also be in <math>P</math>, but <math>P</math> <math>\subseteq</math> <math>NP</math>) |
+ | *If <math>A</math> is reduced to <math>B</math> and <math>B</math> $\in$ NPC, then <math>A</math> $\in$ <math>NP</math> | ||
+ | *If <math>A</math> is reduced to <math>B</math> and <math>B</math> $\in$ NPH, then <math>A</math> $\in$ <math>P</math> | ||
*If problem <math>A</math> is reduced to a problem <math>B</math> and <math>B</math> $\in$ P, then <math>A</math> $\in$ <math>P</math> | *If problem <math>A</math> is reduced to a problem <math>B</math> and <math>B</math> $\in$ P, then <math>A</math> $\in$ <math>P</math> | ||
*If problem <math>A</math> is reduced to a problem <math>B</math> and <math>B</math> $\in$ P, then <math>A</math> $\in$ <math>P</math> | *If problem <math>A</math> is reduced to a problem <math>B</math> and <math>B</math> $\in$ P, then <math>A</math> $\in$ <math>P</math> | ||
*If problem <math>A</math> is reduced to a problem <math>B</math> and <math>B</math> $\in$ P, then <math>A</math> $\in$ <math>P</math> | *If problem <math>A</math> is reduced to a problem <math>B</math> and <math>B</math> $\in$ P, then <math>A</math> $\in$ <math>P</math> | ||
*If problem <math>A</math> is reduced to a problem <math>B</math> and <math>B</math> $\in$ P, then <math>A</math> $\in$ <math>P</math> | *If problem <math>A</math> is reduced to a problem <math>B</math> and <math>B</math> $\in$ P, then <math>A</math> $\in$ <math>P</math> |
Assume all reductions are done in polynomial time
$P \subseteq NP \subseteq NPC \subseteq NPH$
Consider problems $A$ and $B$
Assume all reductions are done in polynomial time
$P \subseteq NP \subseteq NPC \subseteq NPH$