摘要
对于有限可重组合问题 ,通常用母函数方法[1] 作解答 ,但当数据比较大时 ,母函数方法就不太方便。更重要的是 ,母函数方法很难在计算机中实现。
To solve the finite duplicatable combination, the general method is using generating function. But when it comes to a large scale,using generating function is not convenient enough. Especially, it is very difficult for generating function to be realized in computer. This thesis gives a few formulistic methods for several finite duplicatable combinations.
出处
《航空计算技术》
2001年第3期16-18,共3页
Aeronautical Computing Technique
关键词
可重数
有限可重组合
公式型解法
multiplicity
finite k-duplicatable combination
finite 2-duplicatable combination
