Mixing Time of Markov chain of the Knapsack Problem

Koko K. Kayibi, S. Pirzada, Carrie Rutherford

To find the number of assignments of zeros and ones satisfying a specific Knapsack Problem is $\#P$ hard, so only approximations are envisageable. A Markov chain allowing uniform s…