SOS Dynamic problem

[Yasmany Molina Diaz]

Hello programmers:

I need known how calculate the minimum count of string of 0's and 1's for obtain other string filled of 1's. For example:

0101010111 (1)
1000000100 (2)
0000001001 (3)
0100010110 (4)
1110100010 (5)

In this case I need 3 strings: 1, 3, 5

This is too: Graphs Teory, but I don't known...

Thanks

[Adrian Kuegel]

If I understand it right, this problem is the same as finding the minimum number of prime implicants in the formula minimisation method of Quine McClusky (1 means: prime implicant is covered, 0 means: not covered, and you need to cover all selecting fewest number of string literals). This problem is known to be np complete.
For example here is description of Quine McClusky: http://poppy.snu.ac.kr/~kchoi/class/icd ... _level.pdf