Graph isomorphism is one of the two big problems which are not known to be in P ...

		cperciva on Oct 8, 2011 \| parent \| context \| favorite \| on: An Annoying Open Problem 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.)