Reducing SAT to a P problem in polinomial time

Asked Mar 23 '19 at 23:03

Active Mar 23 '19 at 23:03

Viewed 33 times

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

asked Mar 23 '19 at 23:03

Pitchas

0 Answers0