Ivanyos, Gábor and Magniez, F. and Sántha, M. (2001) Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. In: 13th annual symposium on parallal algorithms and architectures. SPAA 2001. Crete Island, Proceedings..

Full text not available from this repository.

Item Type:	Conference or Workshop Item (Paper)
Subjects:	Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions:	Informatics Laboratory
Depositing User:	Eszter Nagy
Date Deposited:	11 Dec 2012 15:08
Last Modified:	11 Dec 2012 15:08
URI:	https://eprints.sztaki.hu/id/eprint/2625

Update Item