摘要
对应用范围很广的一类求解非数值计算问题,不用传统正规算法,而用发展了字上的递推,而递推关系是刻画组合结构的最合适的工具。讨论了置换问题中的递推关系建立和递推性质,并构造出一类置换问题的算法。
For the resolvability study of a class of widely applied nonnumerical problems, instead of by conventional algorithms, the recurrence of developed words are in use. Recurrent relations are the most suitable tool for depicting the combined structure in question. In this paper, the establishment of recurrent relations and the properties of recurrence in replacement problems are discussed. Finally, an algorithm procedure based on recurrent theory for a class of replacement problems is presented.
出处
《长春工业大学学报》
CAS
2003年第2期31-33,共3页
Journal of Changchun University of Technology
关键词
置换
非数值计算
递推求解
算法
replacement
non-numerical computations
recurrent solving
algorithm.
