Return to Revisions

1 of 2

asked May 13, 2016 at 9:03

25.4k
10
66
121

Finite objects for which isomorphism is NP-hard or harder?

Are there finite objects for which deciding isomorphism is NP-hard or harder?

Graphs and group are not solutions.

Searching the web didn't return answer for me.

reference-request computational-complexity isomorphism-testing

asked May 13, 2016 at 9:03

25.4k
10
66
121