This course continues our data structures and algorithms specialization by focussing on the use of linear and integer programming formulations for solving algorithmic problems that seek optimal ...

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

Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field.

This sort of exponential growth is the defining feature of a hard computational problem. But not all hard problems are equally hard — some have algorithms that are faster than exhaustive search, ...

The library sorting problem is used across computer science for organizing far more than just books. A new solution is less than a page-width away from the theoretical ideal.

The Stanford researchers apply Grover’s algorithm to the number partitioning problem by encoding each possible partition of the integer list as a quantum state. They also formulate an oracle that can ...