←back to thread

108 points BerislavLopac | 1 comments | | HN request time: 0.252s | source
Show context
ykonstant ◴[] No.43714569[source]
I am confused about the precise statement of the problem that is claimed to be provably NP-hard, decidable and not in NP. Any clarification?
replies(2): >>43714692 #>>43714727 #
1. penteract ◴[] No.43714692[source]
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?