| 基于分治策略求解方程根的个数 |
| |
| 引用本文： | 钱萌,程玉胜,程树林,叶敏,汪智华,齐乐. 基于分治策略求解方程根的个数[J]. 微机发展, 2006, 16(9): 41-43 |
| |
| 作者姓名： | 钱萌 程玉胜 程树林 叶敏 汪智华 齐乐 |
| |
| 作者单位： | 安庆师范学院计算机与信息学院 安徽安庆246011 |
| |
| 基金项目： | 安徽省教育厅自然科学研究计划资助项目(2004kj265) |
| |
| 摘 要： | n元高次方程根的个数求解常因问题的规模过大而使通常的算法时间复杂度过高。主要介绍了基于分治策略的二分思想来降低该问题的时间复杂度,并利用哈希技术和线性冲突解决方法进一步提高求解n元高次方程根个数的算法效率。
|
| 关 键 词： | 分治策略 哈希函数 二分法 查找 |
| 文章编号： | 1673-629X(2006)09-0041-03 |
| 修稿时间： | 2006-01-06 |
Seeking for Roots of Equation Based on Strategy of Divide and Conquer |
| |
| QIAN Meng,CHENG Yu-sheng,CHENG Shu-lin,YE Min,WANG Zhi-hua,QI Le. Seeking for Roots of Equation Based on Strategy of Divide and Conquer[J]. Microcomputer Development, 2006, 16(9): 41-43 |
| |
| Authors: | QIAN Meng CHENG Yu-sheng CHENG Shu-lin YE Min WANG Zhi-hua QI Le |
| |
| Abstract: | The seeking for roots of n-members hyper-polynomial equation has large time complexity due to the size of n.In this paper,the efficiency of algorithm is improved by operating of binary based on the strategy of divide and conquer as well as using the Hash table and the linear method to resolve the conflicts. |
| |
| Keywords: | strategy of divide and conquer Hash function binary operation search |
| 本文献已被 CNKI 等数据库收录！ |
