Computing with subfields

被引:1
作者
Daberkow, M [1 ]
机构
[1] TECH UNIV BERLIN, FACHBEREICH 3, D-10623 BERLIN, GERMANY
关键词
D O I
10.1006/jsco.1996.0139
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The algorithms presented here make use of subfield information to improve computations. For the three problems we deal with in this paper, the solution of relative norm equations, computation of independent units in the Galois closure of quartic fields and the computation of relative integral bases in quadratic extensions of number fields, we will outline the necessary algorithms that use subfield information and whenever possible we will compare the running time of each algorithm with the equivalent method not using subfield information. (C) 1997 Academic Press Limited.
引用
收藏
页码:371 / 384
页数:14
相关论文
共 16 条
  • [1] [Anonymous], 1993, COMPUTATIONAL ALGEBR
  • [2] ARTIN E, 1965, QUESTIONS BASE MINIM, P229
  • [3] Bosma W., 1991, Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation. ISSAC '91, P151, DOI 10.1145/120694.120714
  • [4] Bosma W., 1995, HDB MAGMA FUNCTIONS
  • [5] Cohen H., 1993, Graduate Texts in Mathematics
  • [6] DABERKOW M, 1996, MATH COMP
  • [7] DABERKOW M, 1993, THESIS DUSSELDORF
  • [8] *FACHGR COMP GI, 1993, COMP DTSCH, P212
  • [9] FINCKE U, 1983, LECT NOTES COMPUT SC, V162, P194
  • [10] HASSE H, 1970, ZAHLBERICHT