24 Sep
2003
24 Sep
'03
11:46 a.m.
On Tue, Sep 23, 2003 at 11:43:33AM -0700, Richard Schroeppel wrote:
Similar questions exist for graphs & other math objects.
The graph isomorphism problem is known to be NP-complete, so any sort of properties that distinguish graphs is likely to be hard to compute. Is there a way of stating a finite-group-isomorphism problem so that it is decideable? Is it then NP-complete? Peace, Dylan