1 problem

Let the knapsack polytope be the convex hull of the $0$–$1$ vectors satisfying a knapsack constraint. The complexity class $\mathsf{D^p}$ consists of all languages that are the int…