A Parallel Time/Processor Tradeoff T.P=O(n^(log M)/M) for the Subset-Sum Problem - researchr publication

researchr

You are not signed in
Sign in
Sign up

Fouad B. Chedid. A Parallel Time/Processor Tradeoff T.P=O(n^(log M)/M) for the Subset-Sum Problem. In Edwin Hsing-Mean Sha, editor, Proceedings of the ISCA 14th International Conference on Parallel and Distributed Computing Systems, August 8-10, 2001, Richardson, Texas, USA. pages 478-481, ISCA, 2001.

Abstract is missing.

runs on WebDSL