4 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.DS2015
Upper bound on the number of steps for solving the subset sum problem by the Branch-and-Bound method
Roman Kolpakov, Mikhail Posypkin
We study the computational complexity of one of the particular cases of the knapsack problem: the subset sum problem. For solving this problem we consider one of the basic variants…
cs.DC2011★ 4 cited
Parallel algorithms for SAT in application to inversion problems of some discrete functions
Alexander Semenov, Oleg Zaikin, Dmitry Bespalov +1
In this article we consider the inversion problem for polynomially computable discrete functions. These functions describe behavior of many discrete systems and are used in model c…