0
$\begingroup$

Subset Product Problem is $NP-Complete$. Given a promise that the product contains exactly 1 occurrences of each of its prime factor is the problem still $NP-Complete$?

Seems to be the case but couldn't find any references. Can someone confirm?

$\endgroup$

1 Answer 1

1
$\begingroup$

Yes, by reduction from exact cover.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.