This is the second installment of a two-part article from guest blogger Ed Aboufadel. Thanks again, Ed, for contributing. In Part I, we learned of an instance of the NP-complete problem subset-sum [1] ...

Quantum computers get a lot of people excited because they solve problems in a manner that's fundamentally different from existing hardware. A certain class of mathematical problems, called ...

We generalize the classical knapsack and subset sum problems to arbitrary groups and study the computational complexity of these new problems. We show that these problems, as well as the bounded ...