{"year":"2000","author":[{"first_name":"Katharina","full_name":"Geissler, Katharina","last_name":"Geissler"},{"id":"21202","first_name":"Jürgen","full_name":"Klüners, Jürgen","last_name":"Klüners"}],"keyword":["Computational Mathematics","Algebra and Number Theory"],"issue":"6","_id":"34900","publication_identifier":{"issn":["0747-7171"]},"language":[{"iso":"eng"}],"publisher":"Elsevier BV","type":"journal_article","user_id":"93826","intvolume":" 30","status":"public","date_created":"2022-12-23T09:58:16Z","date_updated":"2023-03-06T09:58:06Z","department":[{"_id":"102"}],"citation":{"short":"K. Geissler, J. Klüners, Journal of Symbolic Computation 30 (2000) 653–674.","apa":"Geissler, K., & Klüners, J. (2000). Galois Group Computation for Rational Polynomials. Journal of Symbolic Computation, 30(6), 653–674. https://doi.org/10.1006/jsco.2000.0377","bibtex":"@article{Geissler_Klüners_2000, title={Galois Group Computation for Rational Polynomials}, volume={30}, DOI={10.1006/jsco.2000.0377}, number={6}, journal={Journal of Symbolic Computation}, publisher={Elsevier BV}, author={Geissler, Katharina and Klüners, Jürgen}, year={2000}, pages={653–674} }","mla":"Geissler, Katharina, and Jürgen Klüners. “Galois Group Computation for Rational Polynomials.” Journal of Symbolic Computation, vol. 30, no. 6, Elsevier BV, 2000, pp. 653–74, doi:10.1006/jsco.2000.0377.","ama":"Geissler K, Klüners J. Galois Group Computation for Rational Polynomials. Journal of Symbolic Computation. 2000;30(6):653-674. doi:10.1006/jsco.2000.0377","chicago":"Geissler, Katharina, and Jürgen Klüners. “Galois Group Computation for Rational Polynomials.” Journal of Symbolic Computation 30, no. 6 (2000): 653–74. https://doi.org/10.1006/jsco.2000.0377.","ieee":"K. Geissler and J. Klüners, “Galois Group Computation for Rational Polynomials,” Journal of Symbolic Computation, vol. 30, no. 6, pp. 653–674, 2000, doi: 10.1006/jsco.2000.0377."},"doi":"10.1006/jsco.2000.0377","volume":30,"publication_status":"published","page":"653-674","abstract":[{"text":"We describe methods for the computation of Galois groups of univariate polynomials over the rationals which we have implemented up to degree 15. These methods are based on Stauduhar’s algorithm. All computations are done in unramified p -adic extensions. For imprimitive groups we give an improvement using subfields. In the primitive case we use known subgroups of the Galois group together with a combination of Stauduhar’s method and the absolute resolvent method.","lang":"eng"}],"publication":"Journal of Symbolic Computation","title":"Galois Group Computation for Rational Polynomials"}