New research from the University of 蓝莓视频 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 researcher working in the field of algorithmic approximation, is by breaking the problem down into smaller pieces.聽
鈥淓veryone working in computer science and mathematics knows about the 鈥楶 vs. NP鈥 problem,鈥 Seth says. 鈥淚t鈥檚 one of the notorious Millennium Prize Problems: so famous and so difficult that solving one will earn you a million dollars.鈥澛
To understand the crux of the 鈥淧 vs. NP鈥 problem, imagine an enormous jigsaw puzzle or a Sudoku puzzle. It would be a 鈥楶鈥 problem if it could be solved relatively quickly by a computer, whereas they would be an 鈥楴P鈥 problem if they were extremely difficult to solve, but a provided solution could be quickly verified.聽
Read the full story from 蓝莓视频 News to learn more.聽