2 ms·
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-enhance-i
by macmmajor 6y ago
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-enhance-integer-factorization https://cs.stackexchange.com/questions/6650/how-can-p-np-enh...
- fooker 6y agoNeat, thanks!
- raverbashing 6y ago> then integer factorization can be reduced to k-sat, It can be reduced already, but then 3-sat can be solved in P time