New research from the University of Waterloo is making inroads on one of the biggest problems in theoretical computer science. But the way to do it, according to Cameron Seth, a Ph.D. researcher working in the field of algorithmic approximation, is by breaking the problem down into smaller pieces.
Cracking the code of complexity in computer science’s P vs. NP problem
