Questions tagged [np-complete]
For questions about algorithms for so-called 'NP complete' problems, which are among the hardest computational problems to solve.
10 questions
-3 votes
3 answers
212 views
NP-complete problem (subset sum) featured in Netflix series "Suits" S1 E8? [closed]
In the Netflix series Suits, Season 1, Episode 8 (Identity Crisis), the legal team, with the help of a hacker, is tasked with proving that a business magnate embezzled funds, splitting them and ...
- 203
1 vote
2 answers
126 views
Algorithm. Find the group of documents with the least amount of words
I need help with a problem which I have been working for the last month. I have a group of documents, each document has a set of unique words (if the word appears more than once in the document, I ...
- 119
0 votes
1 answer
238 views
Split k sets to 2 groups of sets
Given k sets ,each contain several elements . I want to split them to two groups , the first group contains m sets ,the second group contain n sets , m + n = k . Let w1 be the sum of the weights of ...
- 121
0 votes
2 answers
532 views
Optimization problem where to start, what algorithms to use? [closed]
I have an optimization problem and I was wondering where to start from to be able resolve it. I think it can be solved with an NP-complete algorithm but I am not sure where to start from. The problem ...
- 135
2 votes
2 answers
779 views
Dynamic Programming Problem - To find smallest integer number 'x' which contains only digits 1's and 0's such that x mod n = 0
To design an algorithm that will output the smallest integer number 'x' which contains only digits 1's and 0's such that x mod n = 0 and x > 0..... For example: 2 divides 10 3 divides 111 4 ...
- 105