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.
?Rate how convincing each reason is below to see the overall strength.
No one has weighed in yet. Be the first to share reasons for or against this statement.
Sign in or register to share your perspective on this statement.