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

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

A team of researchers affiliated with several institutions in China created a photonic computer that was able to solve the subset sum problem. In their paper published in the journal Science Advances, ...

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

Memcomputing is a novel non-Turing paradigm of computation that uses interacting memory cells (memprocessors for short) to store and process information on the same physical platform. It was recently ...

In computational complexity theory, P and NP are two classes of problems. P is the class of decision problems that a deterministic Turing machine can solve in polynomial time. In useful terms, any ...

Light propagates in a three-dimensional photonic circuit to solve the subset sum problem. The image of the reconfigurable photonic processor is based on the research presented. As technology advances, ...

For the next couple of weeks, Math Monday here at the blog will feature a guest blogger. Ed Aboufadel is Professor of Mathematics and chair of the Mathematics Department at Grand Valley State ...