macmmajor

3 ms·

1. 1.▲
   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-enh...
2. 2.▲
   by macmmajor 6y ago

   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
3. 3.▲
   by macmmajor 6y ago

   Not in education employed or training