However, in general, I haven't been able to find an efficient
(polynomial time) algorithm to compute this break-down (but I also
haven't yet proved that the problem is NP-complete, so there may be a
polynomial time solution even if P != NP).
Hi Andrew
If possible, please outline the

Randall Britten wrote:
However, in general, I haven't been able to find an efficient
(polynomial time) algorithm to compute this break-down (but I also
haven't yet proved that the problem is NP-complete, so there may be a
polynomial time solution even if P != NP).
Hi Andrew
If possible,