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

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

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

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

Last week, HP Labs mathematician Vinay Deolalikar started circulating a startling paper that claims to have solved the preeminent open problem in computer science, known as P = NP. Er, more accurately ...