May 13, 2004 article Open access The quantum query complexity of the hidden subgroup problem is polynomial Information Processing Letters DOI: 10.1016/j.ipl.2004.01.024 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 1 stored of 153 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access On Homomorphic Encryption Using Abelian Groups: Classical Security Analysis 2024 Association for Women in Mathematics series book-chapter Computer Science Cryptography and Data Security 0 citations 1 result References 0