most citedParallel algorithms for SAT in application to inversion problems of some discrete functions

4 citations · 4 across the 2 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

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…