The paper asserts, without a valid derivation, that the knapsack problem has a subexponential-superpolynomial lower bound inherited from the author's prior 3D spin-glass Ising model complexity claims.
Huang, Statistical mechanics, New York: Wiley, 2008
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
physics.gen-ph 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Lower bound of computational complexity of knapsack problems
The paper asserts, without a valid derivation, that the knapsack problem has a subexponential-superpolynomial lower bound inherited from the author's prior 3D spin-glass Ising model complexity claims.