Ideal decompositions and subfields

Journal of Symbolic Computation

Volumn 21, Issue 2, 1996, Pages 133-137

  Casperson, David ^a   Ford, David ^a   McKay, John ^a  

^a Dept of Electrical and Computer Engineering   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030077129     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1996.0005     Document Type: Article

References (9)

1. 4 extension of Q attached to a non-selfdual automorphic form on GL(3). Math. Ann. 291, 753-766.
2. ]Be Beauzamy, B. (1992). Products of polynomials and a priori estimates for coefficients in polynomial decompositions: a sharp result. J. Symbolic Computation 13, 463-472.
3. ]CM Casperson, D., McKay, J. (1992). An ideal decomposition algorithm. Abstracts A.M.S. 13, 405.
4. ]Di Dixon, J.D. (1990). Computing subfields of algebraic number fields. J. Austral. Math. Soc. (A) 49, 434-448.
5. ]LM Landau, S., Miller, G.L. (1985). Solvability by Radicals Is in Polynomial Time. J. Computer System Sciences 30 179-208.
6. ]MM Mattman, T., McKay, J.. Computing Galois groups over function fields. In preparation.
7. ]Mi Mignotte, M. (1992). Mathematics for Computer Algebra. Springer-Verlag.
8. ]SE Schnorr, C.P., Euchner, M. (1991). Lattice basis reduction: improved practical algorithms and solving subset sum problems. In: Lecture Notes in Computer Science, Springer-Verlag.
9. ]YNT Yokoyama, K., Noro, M., Takeshima, T. (1990). On determining the solvability of polynomials. In: Proceedings of ISSAC '90, ACM Press, New York, 127-134.