Number theorists are always looking for hidden structure. And when confronted by a numerical pattern that seems unavoidable, they test its mettle, trying hard—and often failing—to devise situations in ...

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 ...

There's been a lot of talk about quantum computers being able to solve far more complex problems than conventional supercomputers. The authors of a new paper say they're on the path to showing an ...