2 ms·
Graph isomorphism is one of the two big problems which are not known to be in P and also not known to be NP-complete. (Integer factorization is the other.)
by cperciva 15y ago
Graph isomorphism is one of the two big problems which are not known to be in P and also not known to be NP-complete. (Integer factorization is the other.)