0
In graph isomorphism problem, for which Babai's quasi polynomial algorithm is currently under review (stack), we ask if two adjacency matrices: of $\{0,1\}$ coefficients differ only by a permutation.
Is general problem: without coefficient restriction more difficult, or we can also assume that ...