0

Does reducing SAT in polynomial time to a P problem would mean that P = NP?

Pitchas
  • 1
  • 1
  • The answer to this question is clear when one has a proper understanding of P, NP and NP-hardness reduction. This can be obtained by reading standard resources, such as the one refered to as a duplicate. – Discrete lizard Mar 23 '19 at 23:25
  • So... the answer is yes? – Pitchas Mar 24 '19 at 13:50

0 Answers0