Unsolved problem in computer science: Can the graph isomorphism problem be solved in polynomial time? The graph isomorphism problem is the computational problem of determining whether two finite graphs are isomorphic. Wikipedia