Computer scientists have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum transport costs for ...

A new NURBS-based algorithm is revolutionizing gridshell design by enabling faster, smoother, and more flexible shape-finding ...

A quantum computer is a machine designed to use quantum mechanics to do things which cannot be done by any machine based only on the laws of classical physics. Eventual applications of quantum ...

A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...

Have a problem with many competing variables? Why not solve it with a computer algorithm based on cooling metal? Hosted by: Hank Green Huge thanks go to the following Patreon supporters for helping us ...

After 44 years, there’s finally a better way to find approximate solutions to the notoriously difficult traveling salesperson problem. When Nathan Klein started graduate school two years ago, his ...

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 ...

Even the best poker face won’t work against a new superhuman cardsharp. For the first time, a computer algorithm has solved a game of poker, heads-up limit Texas Hold’em, making it unbeatable in the ...

When Nathan Klein started graduate school two years ago, his advisers proposed a modest plan: to work together on one of the most famous, long-standing problems in theoretical computer science. Even ...