It is not the case that NP-completeness proofs rely on an encoding of problem instances as strings, but the choice of encoding is conventional and can alter polynomial-time reducibility relations.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.