About the coNP-complete ``Injective knapsack'' problem
Prikladnaâ diskretnaâ matematika, no. 3 (2016), pp. 85-92
Voir la notice de l'article provenant de la source Math-Net.Ru
It is proved that the “Injective knapsack” problem is coNP-complete.
Keywords:
NP-complete and coNP-complete problems, injective knapsack, $m$-injective knapsack.
@article{PDM_2016_3_a6,
author = {V. G. Durnev and O. V. Zetkina and A. I. Zetkina and D. M. Murin},
title = {About the {coNP-complete} {``Injective} knapsack'' problem},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {85--92},
publisher = {mathdoc},
number = {3},
year = {2016},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2016_3_a6/}
}
TY - JOUR AU - V. G. Durnev AU - O. V. Zetkina AU - A. I. Zetkina AU - D. M. Murin TI - About the coNP-complete ``Injective knapsack'' problem JO - Prikladnaâ diskretnaâ matematika PY - 2016 SP - 85 EP - 92 IS - 3 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/PDM_2016_3_a6/ LA - ru ID - PDM_2016_3_a6 ER -
V. G. Durnev; O. V. Zetkina; A. I. Zetkina; D. M. Murin. About the coNP-complete ``Injective knapsack'' problem. Prikladnaâ diskretnaâ matematika, no. 3 (2016), pp. 85-92. http://geodesic.mathdoc.fr/item/PDM_2016_3_a6/