{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:57Z","timestamp":1759638957244},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,5,22]]},"DOI":"10.1145\/1060590.1060661","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Polynomial time quantum algorithm for the computation of the unit group of a number field"],"prefix":"10.1145","author":[{"given":"Arthur","family":"Schmidt","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt, Fachbereich Informatik, Hochschulstr., Darmstadt"}]},{"given":"Ulrich","family":"Vollmer","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt, Fachbereich Informatik, Hochschulstr., Darmstadt"}]}],"member":"320","published-online":{"date-parts":[[2005,5,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01445125"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"D.\n       \n      Boneh\n     and \n      \n      \n      R.\n       \n      Lipton\n      \n  \n  . \n  Quantum cryptanalysis of hidden linear functions (extended abstract). In Don Coppersmith editor Advances in Cryptology - CRYPTO '95 volume \n  963\n   of \n  Lecture Notes in Computer Science\n  . \n  Springer 1995\n  .]]   D. Boneh and R. Lipton. Quantum cryptanalysis of hidden linear functions (extended abstract). In Don Coppersmith editor Advances in Cryptology - CRYPTO '95 volume 963 of Lecture Notes in Computer Science. Springer 1995.]]","DOI":"10.1007\/3-540-44750-4_34"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-314X(87)90092-8"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-314X(87)90093-X"},{"key":"e_1_3_2_1_5_1","unstructured":"Johannes Buchmann. Zur Komplexit\u00e4t der Berechnung von Einheiten und Klassenzahlen algebraischer Zahlk\u00f6rper 1987. Habilitationsschrift.]]  Johannes Buchmann. Zur Komplexit\u00e4t der Berechnung von Einheiten und Klassenzahlen algebraischer Zahlk\u00f6rper 1987. Habilitationsschrift.]]"},{"key":"e_1_3_2_1_6_1","unstructured":"Johannes\n       \n      Buchmann\n    .\n      \n  \n   \n  A subexponential algorithm for the determination of class groups and regulators of algebraic number fields. In Catherine Goldstein editor S\u00e9minaire de Th\u00e9orie des Nombres Paris 1988--1989 volume \n  91\n   of \n  Progress in Mathematics pages \n  27\n  --\n  41\n  . \n  Birkh\u00e4user 1990\n  .]]  Johannes Buchmann. A subexponential algorithm for the determination of class groups and regulators of algebraic number fields. In Catherine Goldstein editor S\u00e9minaire de Th\u00e9orie des Nombres Paris 1988--1989 volume 91 of Progress in Mathematics pages 27--41. Birkh\u00e4user 1990.]]"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Johannes Buchmann Max J\u00fcntgen and Michael Pohst. A practical version of the generalized lagrange algorithm. Exp. Math. (3):200--207 1994.]]  Johannes Buchmann Max J\u00fcntgen and Michael Pohst. A practical version of the generalized lagrange algorithm. Exp. Math. (3):200--207 1994.]]","DOI":"10.1080\/10586458.1994.10504290"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510001"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1998.0163"},{"key":"e_1_3_2_1_11_1","unstructured":"Alexei Kitaev. Quantum measurements and the abelian stabilizer problem. Electronic Colloquium on Computational Complexity (ECCC) 3(3) 1996.]]  Alexei Kitaev. Quantum measurements and the abelian stabilizer problem. Electronic Colloquium on Computational Complexity (ECCC) 3(3) 1996.]]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/645812.670797"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365701"},{"key":"e_1_3_2_1_15_1","volume-title":"Universit\u00e4t des Saarlandes","author":"Thiel Christoph","year":"1995"}],"event":{"name":"STOC05: Symposium on Theory of Computing","location":"Baltimore MD USA","acronym":"STOC05","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-seventh annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1060590.1060661","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T08:30:10Z","timestamp":1673166610000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1060590.1060661"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5,22]]},"references-count":14,"alternative-id":["10.1145\/1060590.1060661","10.1145\/1060590"],"URL":"https:\/\/doi.org\/10.1145\/1060590.1060661","relation":{},"subject":[],"published":{"date-parts":[[2005,5,22]]},"assertion":[{"value":"2005-05-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}