Solvable group isomorphism, Proceedings of the 19th IEEE Conference on Computational Complexity, pp.91-103, 2004. ,
Trading group theory for randomness, Proceedings of the seventeenth annual ACM symposium on Theory of computing , STOC '85, pp.421-429, 1985. ,
DOI : 10.1145/22145.22192
Fast Monte Carlo Algorithms for Permutation Groups, Journal of Computer and System Sciences, vol.50, issue.2, pp.296-308, 1995. ,
DOI : 10.1006/jcss.1995.1024
From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), pp.469-478, 2005. ,
DOI : 10.1109/SFCS.2005.38
Computing the structure of a finite abelian group, Mathematics of Computation, vol.74, issue.252, pp.2017-2026, 2005. ,
DOI : 10.1090/S0025-5718-05-01740-0
A new algorithm for factoring polynomials over finite fields, Mathematics of Computation, vol.36, issue.154, pp.587-592, 1981. ,
DOI : 10.1090/S0025-5718-1981-0606517-5
Decomposing finite abelian groups, Quantum Information and Computation, vol.1, issue.3, pp.26-32, 2001. ,
Algorithms for the Solution of Systems of Linear Diophantine Equations, SIAM Journal on Computing, vol.11, issue.4, pp.687-708, 1982. ,
DOI : 10.1137/0211057
) in non-standard representation, Groups and Computation II, Proceedings of a SIMACS Workshop, pp.85-100, 1997. ,
On Quantum Algorithms for Noncommutative Hidden Subgroups, Advances in Applied Mathematics, vol.25, issue.3, pp.239-251, 2000. ,
DOI : 10.1006/aama.2000.0699
Hidden translation and orbit coset in quantum computing, Proceedings of the thirty-fifth ACM symposium on Theory of computing , STOC '03, pp.1-9, 2003. ,
DOI : 10.1145/780542.780544
On isomorphism testing of a class of 2-Nilpotent groups, Journal of Computer and System Sciences, vol.42, issue.2, pp.237-248, 1991. ,
DOI : 10.1016/0022-0000(91)90012-T
Efficient quantum algorithms for the hidden subgroup problem over a class of semi-direct product groups, Quantum Information and Computation, vol.7, pp.5-6, 2007. ,
EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM, International Journal of Foundations of Computer Science, vol.14, issue.05, pp.723-740, 2003. ,
DOI : 10.1142/S0129054103001996
Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix, SIAM Journal on Computing, vol.8, issue.4, pp.499-507, 1979. ,
DOI : 10.1137/0208040
Linear time algorithms for Abelian group isomorphism and related problems, Journal of Computer and System Sciences, vol.73, issue.6, pp.986-996, 2007. ,
DOI : 10.1016/j.jcss.2007.03.013
Quantum measurements and the abelian stabilizer problem. arXiv.org e-Print archive, arXiv:quant-ph, 1995. ,
The graph isomorphism problem: its structural complexity, Birkhäuser, 1993. ,
DOI : 10.1007/978-1-4612-0333-9
Efficient isomorphism testing for a class of group extensions, Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, pp.625-636, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00360243
An efficient quantum algorithm for some instances of the group isomorphism problem. Full version of the present paper ,
URL : https://hal.archives-ouvertes.fr/inria-00455763
Finite fields, 2008. ,
DOI : 10.1017/CBO9780511525926
The complexity of word and isomorphism problems for finite groups, Tech. rep, 1976. ,
The Parallel Complexity of Abelian Permutation Group Problems, SIAM Journal on Computing, vol.16, issue.5, pp.880-909, 1987. ,
DOI : 10.1137/0216058
On the n log n isomorphism technique, Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp.51-58, 1978. ,
The power of basis selection in fourier sampling: hidden subgroup problems in affine groups, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1113-1122, 2004. ,
Quantum Computer Algorithms, 1999. ,
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, SIAM Journal on Computing, vol.26, issue.5, pp.1484-1509, 1997. ,
DOI : 10.1137/S0097539795293172
AnO(n) Algorithm for Abelianp-Group Isomorphism and anO(nlogn) Algorithm for Abelian Group Isomorphism, Journal of Computer and System Sciences, vol.53, issue.1, pp.1-9, 1996. ,
DOI : 10.1006/jcss.1996.0045
Succinct quantum proofs for properties of finite groups, Proceedings 41st Annual Symposium on Foundations of Computer Science, pp.537-546, 2000. ,
DOI : 10.1109/SFCS.2000.892141
Quantum algorithms for solvable groups, Proceedings of the thirty-third annual ACM symposium on Theory of computing , STOC '01, pp.60-67, 2001. ,
DOI : 10.1145/380752.380759