![An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem [An article from: European Journal of Operational Research]](https://www.ebooknetworking.net/books/B00/0PA/bigB000PAUS5M.jpg)
An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem [An article from: European Journal of Operational Research]
Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2007. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
In this paper, we suggest a parallel algorithm based on a shared memory SIMD architecture for solving an n item subset-sum problem in time O(2^n^/^2/p) by using p=2^q processors, 0=
Description:
In this paper, we suggest a parallel algorithm based on a shared memory SIMD architecture for solving an n item subset-sum problem in time O(2^n^/^2/p) by using p=2^q processors, 0=
