| 基于结式的判别子域问题算法 |
| |
| 引用本文： | 付治国,夏德胜,刘首硕.基于结式的判别子域问题算法[J].吉林大学学报(理学版),2011,49(5):819-822. |
| |
| 作者姓名： | 付治国 夏德胜 刘首硕 |
| |
| 作者单位： | 1. 吉林大学 数学学院, 长春 130012,2. 吉林大学 软件学院, 长春 130012;3. 空军航空大学 特种专业系, 长春 130022 |
| |
| 摘 要： | 提出一种基于数域上极小多项式结式的算法, 解决了判别子域问题. 算法能保证成功运行, 并且在模p下因式分解只提升某些特定因子. 结果表明, 在大多数情况下, 该算法比基于数域上因式分解的算法更有效.
|
| 关 键 词： | 子域问题 结式 同构 |
| 收稿时间： | 2011-03-28 |
Algorithm for the Subfield Problem Based on the Resultant |
| |
| FU Zhi-guo,XIA De-sheng,LIU Shou-shuo.Algorithm for the Subfield Problem Based on the Resultant[J].Journal of Jilin University: Sci Ed,2011,49(5):819-822. |
| |
| Authors: | FU Zhi-guo XIA De-sheng LIU Shou-shuo |
| |
| Institution: | 1. College of Mathematics, Jilin University, Changchun 130012, China;2. College of Software, Jilin University, Changchun 130012, China;3. Department of Special Professional, |Aviation University of Air Force, Changchun 130022, China |
| |
| Abstract: | This paper presents an algorithm for the subfield problem based on the minimal polynomials of the number fields.The algorithm is guaranteed to success and only lifts some special factors after factoring polynomials mod p.The experimental results show that it is more efficient than the algorithm based on the factorization over number fields in most cases. |
| |
| Keywords: | subfield problem resultant isomorphism |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《吉林大学学报(理学版)》下载免费的PDF全文 |
|
