整数集合の順列と組み合わせを生成する並列アルゴリズムについて

概要

論文の詳細を見る
ABSTRACT : This paper suggests a recursive parallel algorithm that produces the permutations and combinations of a set of integers by using a table of appropriate size. The procedure for generating permutations that runs on the PRAM computer is optimal and adaptive. Furthermore it is a by product of the procedure for MIMD machine. The procedure for generating combinations is derived from the permutations one with minor changes, which is possible due to the use of the table and recursion. Finally, the key feature is that the algorithm presented here is concerned with the problem of an algorithm generating both the permutations and combinations.
山形県立米沢女子短期大学の論文
2002-12-27