|
|
|
|
|
|
by t0010q
384 days ago
|
|
|
It's funny that carries don't just make addition difficult to parallelize. Binary addition without carry is XOR. XOR subset sum - find a subset whose XOR gives the desired target - is in P, but proper subset sum with carry is NP-complete. |
|
|