The original version of this story appeared in Quanta Magazine. The simplest ideas in mathematics can also be the most perplexing. Take addition. It’s a straightforward operation: One of the first ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results