PL EN


Preferences help
enabled [disable] Abstract
Number of results
- |
Article title

A parallel dynamic programming algorithm for unranking set partitions

Content
Title variants
Languages of publication
PL
Abstracts
PL
In this paper, an O(n) parallel algorithm is presented for unranking set partitions in Hutchinson’s representation. A simple sequential algorithm is derived on the basis of a dynamic programming paradigm. In the parallel algorithm, processing is performed in a dedicated parallel architecture combining certain systolic and associative features. The algorithm consists of two phases. In the first phase, a coefficient table is created by systolic computations. Then, n subsequent elements of a partition codeword are computed, in O(1) time each, through associative search operations.
Publisher
Year
-
Physical description
Dates
online
2015-04-21
Contributors
References
Document Type
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.ojs-nameId-6e3e8ea9-5a94-37a7-828b-e6cd5da23db6-year-2015-article-1752
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.