The integer factorization problem is the computational problem of determining the prime factorization of a given integer.
Along the same lines, co-NP is the class containing the complement problems (i.e.