On lower bounds for read-k-times branching programs
Computational Complexity
Size of ordered binary decision diagrams representing threshold functions
Theoretical Computer Science
Neither reading few bits twice nor reading illegally helps much
Discrete Applied Mathematics
On P versus NP CO-NP for decision trees and read-once branching programs
Computational Complexity
Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
INFORMS Journal on Computing
On the size of (generalized) OBDDs for threshold functions
Information Processing Letters
A Stronger Model of Dynamic Programming Algorithms
Algorithmica
| Hi-index | 5.23 |
Already 30 years ago, Chvatal has shown that some instances of the zero-one knapsack problem cannot be solved in polynomial time using a particular type of branch-and-bound algorithms based on relaxations of linear programs together with some rudimentary cutting-plane arguments as bounding rules. We extend this result by proving an exponential lower bound in a more general class of branch-and-bound and dynamic programming algorithms which are allowed to use memoization and arbitrarily powerful bound rules to detect and remove subproblems leading to no optimal solution.