New answers tagged polynomial-time-reductions
2
votes
Accepted
Choose elements from sets that form a permutation: NP hard?
It is currently unknown whether your problem is NP-Hard. However, if it were, then it would be the case that P=NP.
To solve the problem in polynomial-time you can check whether a maximum matching in ...
- 28.4k
Top 50 recent answers are included