The subset-sum problem is one of the most frequently occurring NP (nondeterministic, polynomial-time)-complete) problems. It asks whether a subset of numbers in a set of positive integers adds up ...
This implements an abstract version of the default greedy algorithm for reduced basis and empirical interpolation basis generation. The actual implementation of the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results