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.