Viewing profile — macmmajor

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...

You can think of it as applying a mod operator after each operation. Say we wanted to work with mod 5 Then 6 + 8 = 14 = 4 mod 5

Not in education employed or training