There exists a fixed, computable sequence of knapsack weights such that the feasibility problem, whose input is only the profit vector and target, remains NP-complete.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the Complexity of Combinatorial Optimization on Fixed Structures
There exists a fixed, computable sequence of knapsack weights such that the feasibility problem, whose input is only the profit vector and target, remains NP-complete.