Reminder to self:
Think more about fun comparisons of hashes
(allows decomposing of problems by N) and power sets (causes problems
to increase in complexity by 2^N)
The former is the standard technique I’ve used to make hard problems easy
or fast: divide-and-conquer. The latter is a a natural result that for any body of N nodes, full connectivity goes as 2^N: applicable in social networks, etc.
Sounds lke hashing fails to decompose power-set problems.
Can we use power-sets to decompose?