Why Minimizing the Absolute Weight of a Path Is NP-Hard
A small change to the shortest-path objective turns it into a disguised Partition problem.
A small change to the shortest-path objective turns it into a disguised Partition problem.
How far apart can K points be placed on a unit sphere in N-dimensional space?
A binary-encoding solution to a one-round identification puzzle.
A short graph-theoretic proof using the pigeonhole principle.
A simple agreement rule on Yes and No forms the cyclic group of order two.