News for hackers. Stuff that matters.
Re:The Halting Problem is a terrible example of NP-Harder by penteract on Thursday April 17, 2025 @05:42AM (#43714692)
Given a dimension, n; a collection of n-dimensional vectors of integers v_1,..,v_k; and a target n-dimensional vector u: Is there a sequence of vectors from the collection which sums to u, such that no partial sum(of an initial segment of the sequence) has any negative components?

There are no comments on this comment yet.