248 search results - page 1 / 50 » On the Cayley isomorphism problem |
DM
2002
13 years 9 months ago
2002
COMBINATORICS
2002
13 years 9 months ago
2002
Let S be a subset of the units in Zn. Let be a circulant graph of order n (a Cayley graph of Zn) such that if ij E(), then i - j (mod n) S. Toida conjectured that if is another...
ISTCS
1997
Springer
14 years 1 months ago
1997
Springer
We study the subtree isomorphism problem: Given trees H and G, find a subtree of G which is isomorphic to H or decide that there is no
LICS
2010
IEEE
13 years 7 months ago
2010
IEEE
Several new undecidability results on isomorphism problems for automatic structures are shown: (i) The isomorphism problem for automatic equivalence relations is 0 1complete. (ii)...
MST
2011
13 years 15 days ago
2011
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...