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

Researchers at Shanghai Jiao Tong University have developed a reconfigurable three-dimensional integrated photonic processor to tackle the subset sum problem (SSP), a challenging NP-complete ...

We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed Carmichael numbers with k prime factors for every k between 3 and 19,565,220. These computations ...

As an example of an easy-to-check but hard-to-find solution, one can look at the subset sum problem: determining whether or not a subset of numbers adds to zero is easy, but picking that subset ...