NP-completeness proofs rely on an encoding of problem instances as strings, but the choice of encodi...