Rian Neogi
@rianneogi.bsky.social
PhD at the Department of Combinatorics & Optimization at University of Waterloo.
Reposted by Rian Neogi
Cameron Seth is breaking down the world’s hardest CS problem piece by piece.
“What I’m doing is looking at a series of smaller problems related to the broader P vs. NP problem. Essentially, what I’m asking is if we can solve these other related problems,” Cam says.
uwaterloo.ca/news/mathema...
“What I’m doing is looking at a series of smaller problems related to the broader P vs. NP problem. Essentially, what I’m asking is if we can solve these other related problems,” Cam says.
uwaterloo.ca/news/mathema...
November 14, 2025 at 6:06 PM
Cameron Seth is breaking down the world’s hardest CS problem piece by piece.
“What I’m doing is looking at a series of smaller problems related to the broader P vs. NP problem. Essentially, what I’m asking is if we can solve these other related problems,” Cam says.
uwaterloo.ca/news/mathema...
“What I’m doing is looking at a series of smaller problems related to the broader P vs. NP problem. Essentially, what I’m asking is if we can solve these other related problems,” Cam says.
uwaterloo.ca/news/mathema...