Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem (bibtex)

by G. Ivanyos, F. Magniez and M. Santha

Reference:

Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem (G. Ivanyos, F. Magniez and M. Santha), In Proceedings of 13th ACM Symposium on Parallelism in Algorithms and Architectures, 2001.

Bibtex Entry:

@inproceedings{ims01,
	author = {G. Ivanyos and F. Magniez and M. Santha},
	booktitle = {Proceedings of 13th ACM Symposium on Parallelism in Algorithms and Architectures},
	pages = {263-270},
	pdf = {./PAPIERS/ims-spaa01.pdf},
	title = {Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem},
	year = {2001},
	bdsk-url-1 = {./PAPIERS/ims-spaa01.pdf}}