A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Keywords: Model of algorithms The pBT model Knapsack problem Exponential time lower bounds Backtracking a b s t r a c t We prove an Ω(2 0.69n / √ n) time lower bound of Knapsack problem under the adaptive priority branching trees (pBT) model. The pBT model is a formal model of algorithms covering backtracking and dynamic programming [M. Alekhnovich, A. Borodin, A. Magen, J. Buresh-Oppenheim, R. Impagliazzo, T. Pitassi, Toward a model for backtracking and dynamic programming, ECCC TR09-038,doi:10.1016/j.tcs.2009.12.004 fatcat:tcmtg3gzirbiflqy736r74awoq