Quantum computers promise enormous computational power, but the nature of quantum states makes computation and data ...

But most of the time, creating a quantum algorithm that stands a chance at beating a classical computer is an accidental process, Purdue University scientists say. To bring more guidance to this ...

The graph below shows the total number of publications each year in Nash Equilibria and Approximation Algorithms in Game Theory.

Halim Damerdji, Peter W. Glynn, Limit Theory for Performance Modeling of Future Event Set Algorithms, Management Science, Vol. 44, No. 12, Part 1 of 2 (Dec., 1998 ...

This paper considers the problem of scheduling n jobs, each having a processing time, a due date and a weight, on a single machine to minimize the weighted number of late jobs. An O (n log n) ...

Voting Theory and Polynomial Algorithms Publication Trend The graph below shows the total number of publications each year in Voting Theory and Polynomial Algorithms.

"These algorithms and policies that are derived from the study of matching theory have so many useful applications," she says. "Usually in mathematics there's a lot of abstraction.

A new theory could bring a way to make quantum algorithm development less of an accidental process, say scientists.