Prove that every problem in P is reducible

Question

Possible Duplicate:
For two problems A and B, if A is in P, then A is reducible to B?

Given two problems $A$ and $B$, if $A$ is in $\def\P{{\mathcal P}}\P$ then $A$ is reducible to $B$. ($A < B$)

Why does it not matter if $B$ is in $\P$ or $\mathcal{NP}$?
Why can just knowing that $A$ is in $\P$ mean that it is reducible regardless of $B$?

Please state your definition of reducible. In these questions it is vital that you know what the terms mean with great precision. — Erick Wong, Oct 08 '12 at 16:48

score 2 · Accepted Answer · answered Oct 08 '12 at 16:57

2

You've sort of answered your own question.

"$A$ is reducible to $B$" means "Given a black box that solves problem $B$ in constant time, we can solve problem $A$ in polynomial time." Since $A$ is in $P$, this statement is always true: we can simply throw away our black box to $B$ and solve $A$ without it.

answered Oct 08 '12 at 16:57

GMB

4,186

Thanks, rewriting it like that clears up some of my confusion. – Takkun Oct 08 '12 at 17:01
1

I have a question regarding this answer: Why does B have to be solved in constant time? – eva Feb 12 '15 at 16:10

Prove that every problem in P is reducible

1 Answers1