Similarly, the complexity class GI consists of the problems that can be reduced to the graph isomorphism problem. Since graph isomorphism is known to belong both to NP and co-AM, the same is true for every problem in this class. A problem is GI-complete if it is complete for this class; the graph isomorphism problem itself is GI-complete, as are several other related problems..
Similarly, the complexity class GI .consists of the problems that can be reduced to the graph isomorphism problem. Since graph: isomorphism is known to belong both to NP and co-AM, the same is true for every prob,lem in this class. A problem is GI-complete if it is complete for this class; the graph isomorphism probl.em itself i!s GI-complete, as are several other related problems..