Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Is it possible to have a decision problem A$A$ which belongs to P and reduce it to a decision problem B$B$ which belongs to NP, i.e. A <=p B$A \leq_{\mathrm{p}} B$, where A$A$ belongs to P, B$B$ belongs to NP?
Is it possible to have a decision problem A which belongs to P and reduce it to a decision problem B which belongs to NP, i.e. A <=p B, where A belongs to P, B belongs to NP?
Is it possible to have a decision problem $A$ which belongs to P and reduce it to a decision problem $B$ which belongs to NP, i.e. $A \leq_{\mathrm{p}} B$, where $A$ belongs to P, $B$ belongs to NP?
Decision problem which belongs to P reduced to a decision problem which belongs to NP?
Is it possible to have a decision problem A which belongs to P and reduce it to a decision problem B which belongs to NP, i.e. A <=p B, where A belongs to P, B belongs to NP?
