problem. Both weak NP-hardness and weak polynomial-time correspond to encoding the input integers in binary coding. If a problem is strongly NP-hard, then...