ABOUT THE CONP-COMPLETE “INJECTIVE KNAPSACK” PROBLEM

DOI10.17223/20710410/33/7zbMath1490.68111OpenAlexW2552368292MaRDI QIDQ5150749

O. V. Zetkina, D. M. Murin, A. I. Zetkina, V. G. Durnev

Publication date: 15 February 2021

Published in: Prikladnaya diskretnaya matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm550

zbMATH Keywords

NP-complete problemscoNP-complete problems\(m\)-injective knapsackinjective knapsack

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• On the equal-subset-sum problem
• A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)
• Reducibility among Combinatorial Problems
• Hiding information and signatures in trapdoor knapsacks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: ABOUT THE CONP-COMPLETE “INJECTIVE KNAPSACK” PROBLEM