More information: Xiaomeng Sui et al, Non-convex optimization for inverse problem solving in computer-generated holography, Light: Science & Applications (2024). DOI: 10.1038/s41377-024-01446-w ...

Computer programmers have developed a new 'cutting-plane' algorithm, a general-purpose algorithm for solving optimization problems. The algorithm improves on the running time of its most efficient ...

The "maximum independent set" problem, solved by the team, is a paradigmatic hard task in computer science and has broad applications in logistics, network design, finance, and more.

A quantum computer can solve optimization problems faster than classical supercomputers, a process known as "quantum advantage" and demonstrated by a USC researcher in a paper recently published ...

It’s been difficult to find important questions that quantum computers can answer faster than classical machines, but a new algorithm appears to do so for some critical optimization tasks.

Hash tables are among the most thoroughly studied data structures in all of computer science; the advance sounded too good to be true. But just to be sure, he asked a frequent collaborator (and a ...