| 两类常见问题大规模求解的算法探讨 |
| |
| 引用本文： | 郑先容,汤浪平.两类常见问题大规模求解的算法探讨[J].湖南城市学院学报(自然科学版),2005,14(3):72-74. |
| |
| 作者姓名： | 郑先容 汤浪平 |
| |
| 作者单位： | 湖南城市学院,计算机科学系,湖南,益阳,413000;益阳市建设银行,科技处,湖南,益阳,413000 |
| |
| 摘 要： | 通过一个兑换硬币问题和一个求整数因数问题,讨论了一类组合问题求解和分解质因数的计算机算法,得出2个高效的优化算法.
|
| 关 键 词： | 兑换硬币 分解质因数 算法 时间复杂度 |
| 文章编号： | 1672-7304（2005）03-0072-03 |
| 收稿时间： | 2005-01-25 |
| 修稿时间： | 2005年1月25日 |
Probing Account Form about Two Frequent Questions for Solution on Large Scale |
| |
| ZHENG Xian-rong,TANG Lang-ping.Probing Account Form about Two Frequent Questions for Solution on Large Scale[J].Journal of Hunan City University:Natural Science,2005,14(3):72-74. |
| |
| Authors: | ZHENG Xian-rong TANG Lang-ping |
| |
| Abstract: | This paper discusses the computer accounting technique of a kind of combinational theory to seek solution and resolving into factions by means of one problem of coins changing banknotes and to seek integer and prime number. It is concluded two optimizing high-effective accounting techniques. |
| |
| Keywords: | Coins charge banknotes resolve into factors of prime number accounting technique time complicated degree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
