Cameron Seth is breaking down the world’s hardest CS problem piece by piece
Research from the Cheriton School of Computer Science is making inroads on one of the biggest problems in theoretical computer science. But the way to do it, according to Cameron Seth, a PhD candidate working in the field of algorithmic approximation, is by breaking the problem down into smaller pieces.
“Everyone working in computer science and mathematics knows about the ‘P vs. NP’ problem,” Cameron says. “It’s one of the notorious Millennium Prize Problems: so famous and so difficult that solving one will earn you a million dollars.”