NP-completeness proofs require encoding problems as strings; changing the encoding scheme can change...
This proposition has not been edited since the history system was added.