An alternative to Ben-Or s lower bound for the knapsack problem complexity

Valentin E. Brimkov, Stefan S. Dantchev. An alternative to Ben-Or s lower bound for the knapsack problem complexity. Appl. Math. Lett., 15(2):187-191, 2002. [doi]

@article{BrimkovD02,
  title = {An alternative to Ben-Or s lower bound for the knapsack problem complexity},
  author = {Valentin E. Brimkov and Stefan S. Dantchev},
  year = {2002},
  doi = {10.1016/S0893-9659(01)00116-1},
  url = {http://dx.doi.org/10.1016/S0893-9659(01)00116-1},
  tags = {e-science},
  researchr = {https://researchr.org/publication/BrimkovD02},
  cites = {0},
  citedby = {0},
  journal = {Appl. Math. Lett.},
  volume = {15},
  number = {2},
  pages = {187-191},
}