|
ИСТИНА |
Войти в систему Регистрация |
Интеллектуальная Система Тематического Исследования НАукометрических данных |
||
Lower time bounds for parallel solving of the subset sum problem by a dynamic programming algorithmстатья
- Авторы: Kolpakov Roman, Posypkin Mikhail
- Журнал: Concurrency Computation Practice and Experience
- Год издания: 2024
- Издательство: John Wiley & Sons Inc.
- Местоположение издательства: United States
- DOI: 10.1002/cpe.8144
- Аннотация: In the paper we compute some lower bounds on time of parallel solving of the subset sum problem on a big number of processors by several versions of dynamic programming algorithm Balsub proposed before by Pisinger. Based on these lower bounds, we propose a version of Balsub which could be possibly effectively parallelized.
- Добавил в систему: Колпаков Роман Максимович