eWeek

GPT-5.2 Just Solved a 30-Year Math Problem

GPT-5.2 Pro delivers a Lean-verified proof of Erdős Problem 397, marking a shift from pattern-matching AI to autonomous ...
IEEE

FlexSpin: A CMOS Ising Machine With 256 Flexible Spin Processing Elements With 8-b Coefficients for Solving Combinatorial Optimization Problems

Abstract: Combinatorial optimization problems (COPs) are essential in various applications, including data clustering, supply chain management, and communication networks. Many real-world COPs are non ...
IEEE

A Compute-in-Memory Annealing Processor With Interaction Coefficient Reuse and Sparse Energy Computation for Solving Combinatorial Optimization Problems

Since combinatorial optimization problems (COPs) are a class of non-deterministic polynomial-time (NP)-hard problems, it is impracticable to solve them in brute-force searches, which results in high ...