The complexity of equivalence and isomorphism of systems of equations over finite groups☆
Under an Elsevier user license
open archive
Keywords
Graph isomorphism
Computational complexity
Systems of equations
Finite groups
Cited by (0)
- ☆
A preliminary version of this paper appears in Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS’04), Lecture Notes in Computer Science, Vol. 3153, Springer, Berlin, 2004, pp. 380–391.
- 1
Supported by the National Graduate School in Computer Science (CUGS), Sweden.
Copyright © 2005 Elsevier B.V. All rights reserved.