Conventional quantum algorithms are not feasible for solving combinatorial optimization problems (COPs) with constraints in the operation time of quantum computers. To address this issue, researchers ...

Can we ever really trust algorithms to make decisions for us? Previous research has proved these programs can reinforce society’s harmful biases, but the problems go beyond that. A new study shows how ...

In life, we sometimes have to make decisions without all the information we want; that’s true in computer science, too. This is the realm of online algorithms — which, despite their name, don’t ...

What’s the best way to solve hard problems? That’s the question at the heart of a subfield of computer science called computational complexity theory. It’s a hard question to answer, but flip it ...

Estimating the number of triangles in a graph is a fundamental problem and has found applications in many fields. This ...

Tsukuba, Japan—Distributed constraint optimization problems are crucial for modeling cooperative-multiagent systems. Asynchronous Distributed OPTimization (ADOPT) is a well-known algorithm for solving ...

The original version of this story appeared in Quanta Magazine. Computer scientists often deal with abstract problems that are hard to comprehend, but an exciting new algorithm matters to anyone who ...

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...

After months of delays, New York City today began enforcing a law that requires employers using algorithms to recruit, hire or promote employees to submit those algorithms for an independent audit — ...