December 21, 2015 conference-paper Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields ACM-SIAM Symposium on Discrete Algorithms (SODA) DOI: 10.1137/1.9781611974331.ch64 OpenAlex Authors 0 Author list not loaded yet. Cited by 2 stored of 84 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 Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time 2021 Journal of the ACM article Computer Science Cryptography and Data Security Open access 20 citations On the Quantum Complexity of the Continuous Hidden Subgroup Problem 2020 Lecture notes in computer science conference-paper Computer Science Quantum Computing Algorithms and Architecture Open access 7 citations 2 results References 0