News for hackers. Stuff that matters.

A comment on My survey article on P vs. NP (2017). Parent comment

Re:My survey article on P vs. NP (2017) by macmmajor on Tuesday March 23, 2021 @12:06PM (#26556646)
If p == np, then interger factorization can be reduced to k-sat, which is solvable in p time

https://cs.stackexchange.com/questions/6650/how-can-p-np-enh...

[ Parent | on HN ]
Re:My survey article on P vs. NP (2017) by raverbashing on Tuesday March 23, 2021 @12:12PM (#26556712)
> then integer factorization can be reduced to k-sat,

It can be reduced already, but then 3-sat can be solved in P time

[ Parent | on HN ]
Re:My survey article on P vs. NP (2017) by fooker on Tuesday March 23, 2021 @12:17PM (#26556762)
Neat, thanks!
[ Parent | on HN ]