On validated computing in algebraic number fields

Journal of Symbolic Computation

Volumn 24, Issue 6, 1997, Pages 657-665

  Pohst, Michael E ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (11)

1. Cohen, H. (1993). A Course in Computational Algebraic Number Theory. Berlin, Springer.
2. Daberkow, M., Fieker, C., Klüners, J., Pohst, M., Roegner, K., Schörnig, M., Wildanger, K. (1997). KANT 4. J. Symbolic Comput. 24, 267-283.
3. Fachgruppe Computeralgebra der GI, DMV and GAMM (1993). Computeralgebra in Deutschland, Passau und Heidelberg.
4. Gaàl, I., Pethö, A., Pohst, M. (1994). On the resolution of index form equations in biquadratic number fields III. The bicyclic biquadratic case. J. Number Theory 53, 100-114.
5. Lenstra, A.K., Lenstra, H.W. Jr, Lovasz, L. (1982). Factoring polynomials with rational coefficients. Math. Ann. 261, 515-534.
6. Pohst, M. (1993). Computational Algebraic Number Theory. Basel, Birkhäuser.
7. Pohst, M. (1994). On computing fundamental units. J. Number Theory 47, 93-105.
8. Pohst, M., Zassenhaus, H. (1989). Algorithmic Algebraic Number Theory. Cambridge University Press, Cambridge.
9. Ratschek, H., Rokne, J. (1988). New Computer Methods for Global Optimization, New York, Wiley.
10. Schmidt, J. W. (1984). Two-sided approximations of inverses, square roots and Cholesky factors. Comp. Math., Banach Center Publications 15 Warsaw 1984, pp. 483-497.
11. Tzanakis, N., de Weger, B.M.M. (1992). How to explicitly solve a Thue - Mahler equation. Comp. Math. 84, 223-288.