The lower bound on complexity of parallel branch-and-bound algorithm for subset sum problem

Author(s):  
Roman Kolpakov ◽  
Mikhail Posypkin
Sign in / Sign up

Export Citation Format

Share Document