Modern computation based on von Neumann architecture is now a mature cutting-edge
science. In the von Neumann architecture, processing and memory units are implemented …

Combinatorial optimization problems belong to the non-deterministic polynomial time (NP)-
hard complexity class, and their computational requirements scale exponentially with …

Computational architectures that are optimized to solve non-deterministic polynomial-time
hard or complete problems are of use in the development of machine learning, logistical …

With the slowdown of Moore's law, many emerging electronic devices and computing
architectures have been proposed to sustain the performance advancement of computing …

Nondeterministic polynomial time hard (NP-hard) combinatorial optimization problems
(COPs) are intractable to solve using a traditional computer as the time to find a solution …

Abstract Time-multiplexed Coherent Ising Machines (CIMs) have demonstrated promising
results in rapidly solving large-scale combinatorial problems. However, CIMs remain …

Not all computing problems are created equal. The inherent complexity of processing certain
classes of problems using digital computers has inspired the exploration of alternate …

Combinatorial optimization problems are prevalent in various fields, but obtaining exact
solutions remains challenging due to the combinatorial explosion with increasing problem …

In this work, we experimentally demonstrate an integrated circuit (IC) of 30 relaxation
oscillators with reconfigurable capacitive coupling to solve the NP-Hard maximum cut (Max …

Nano-oscillators based on phase-transition materials are being explored for the
implementation of different non-conventional computing paradigms. In particular, vanadium …