{"intvolume":"        39","date_updated":"2023-04-04T09:25:08Z","type":"journal_article","_id":"42803","year":"2010","citation":{"apa":"Kirschmer, M., &#38; Voight, J. (2010). Algorithmic Enumeration of Ideal Classes for Quaternion Orders. <i>SIAM Journal on Computing</i>, <i>39</i>(5), 1714–1747. <a href=\"https://doi.org/10.1137/080734467\">https://doi.org/10.1137/080734467</a>","ama":"Kirschmer M, Voight J. Algorithmic Enumeration of Ideal Classes for Quaternion Orders. <i>SIAM Journal on Computing</i>. 2010;39(5):1714-1747. doi:<a href=\"https://doi.org/10.1137/080734467\">10.1137/080734467</a>","chicago":"Kirschmer, Markus, and John Voight. “Algorithmic Enumeration of Ideal Classes for Quaternion Orders.” <i>SIAM Journal on Computing</i> 39, no. 5 (2010): 1714–47. <a href=\"https://doi.org/10.1137/080734467\">https://doi.org/10.1137/080734467</a>.","mla":"Kirschmer, Markus, and John Voight. “Algorithmic Enumeration of Ideal Classes for Quaternion Orders.” <i>SIAM Journal on Computing</i>, vol. 39, no. 5, Society for Industrial &#38; Applied Mathematics (SIAM), 2010, pp. 1714–47, doi:<a href=\"https://doi.org/10.1137/080734467\">10.1137/080734467</a>.","short":"M. Kirschmer, J. Voight, SIAM Journal on Computing 39 (2010) 1714–1747.","ieee":"M. Kirschmer and J. Voight, “Algorithmic Enumeration of Ideal Classes for Quaternion Orders,” <i>SIAM Journal on Computing</i>, vol. 39, no. 5, pp. 1714–1747, 2010, doi: <a href=\"https://doi.org/10.1137/080734467\">10.1137/080734467</a>.","bibtex":"@article{Kirschmer_Voight_2010, title={Algorithmic Enumeration of Ideal Classes for Quaternion Orders}, volume={39}, DOI={<a href=\"https://doi.org/10.1137/080734467\">10.1137/080734467</a>}, number={5}, journal={SIAM Journal on Computing}, publisher={Society for Industrial &#38; Applied Mathematics (SIAM)}, author={Kirschmer, Markus and Voight, John}, year={2010}, pages={1714–1747} }"},"publication_identifier":{"issn":["0097-5397","1095-7111"]},"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the run time of these algorithms and consider several related problems, including the computation of two-sided ideal classes, isomorphism classes of orders, connecting ideals for orders, and ideal principalization. We conclude by giving the complete list of definite Eichler orders with class number at most 2."}],"date_created":"2023-03-07T08:49:35Z","publication":"SIAM Journal on Computing","extern":"1","doi":"10.1137/080734467","keyword":["General Mathematics","General Computer Science"],"department":[{"_id":"102"}],"issue":"5","page":"1714-1747","status":"public","author":[{"id":"82258","last_name":"Kirschmer","first_name":"Markus","full_name":"Kirschmer, Markus"},{"full_name":"Voight, John","first_name":"John","last_name":"Voight"}],"title":"Algorithmic Enumeration of Ideal Classes for Quaternion Orders","user_id":"93826","publisher":"Society for Industrial & Applied Mathematics (SIAM)","publication_status":"published","volume":39}