Login / Signup
Lower time bounds for parallel solving of the subset sum problem by a dynamic programming algorithm.
Roman Kolpakov
Mikhail Posypkin
Published in:
Concurr. Comput. Pract. Exp. (2024)
Keyphrases
</>
upper and lower bounds
lower bound
upper bound
parallel implementation
neural network
lower and upper bounds
parallel hardware
real time
branch and bound search
significantly lower
shared memory
error bounds
combinatorial optimization
reinforcement learning
search engine
information retrieval
machine learning