Computation of the splitting fields and the Galois groups of polynomials-Reference-Cited by-同舟云学术

Computation of the splitting fields and the Galois groups of polynomials

Published:1996 Issue: Volume: Page:29-50
ISSN:
Container-title:Algorithms in Algebraic Geometry and Applications
language:
Short-container-title:

Author:

Anai H.,Noro M.,Yokoyama k.

Publisher

Birkhäuser Basel

Link

http://link.springer.com/content/pdf/10.1007/978-3-0348-9104-2_3.pdf

Reference22 articles.

1. Abott, J. A.,On the factorisation of polynomials over algebraic fields, Ph.D thesis, School of Math. Sci., University of Bath (1989).

2. Abott, J. A., Bradford, R. J., Davenport, J. H., Factorisation of polynomials: Old ideas and recent results, in “Trends in Computer Algebra,” L. N. Comp. Sci. 296, pp. 81 91 (1987).

3. Buchberger, B.,Gröbner bases: an algorithmic method in polynomial ideal theory, in “Multidimensional System Theory.” Reidei Pubi. Comp., pp. 184–232 (1985).

4. Butler, G., “Fundamental algorithms for permutation groups,” L. N. Comp. Sci. 559 (1991).

5. Chistov, A. L., Grigoryev, D. Yu, Polynomial-time factoring of the multi- variable polynomials over a global field, preprint, LOMI E-5–82, Leningrad (1982).

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Arithmetic in Successive Algebraic Extension Fields Using Symmetries;Mathematics in Computer Science;2012-05-24

2. QUINTIC POLYNOMIALS OF HASHIMOTO–TSUNOGAI, BRUMER AND KUMMER;International Journal of Number Theory;2009-06

3. Exact algorithms for $p$-adic fields and epsilon constant conjectures;Illinois Journal of Mathematics;2008-01-01

4. A Modular Method for Computing the Splitting Field of a Polynomial;Lecture Notes in Computer Science;2006

5. A Computer Algebra System: Risa/Asir;Algebra, Geometry and Software Systems;2003