Complexity theory is a fundamental branch of theoretical computer science that categorises computational problems according to their inherent difficulty and the resources required to solve them. At ...

The 30th Annual European Symposium on Algorithms awarded its 2021 Test-of-Time Award to Sorin Istrail, professor of computational and mathematical sciences and professor of computer science, and his ...

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...

Rice quantum computing researchers have introduced a novel algorithm that earned the team a place in the global XPRIZE Quantum Applications competition.

When the Clay Mathematics Institute put individual $1-million prize bounties on seven unsolved mathematical problems, they may have undervalued one entry—by a lot. If mathematicians were to resolve, ...