Generic polynomial algorithms for the knapsack problem in some matrix semigroups
Sibirskie èlektronnye matematičeskie izvestiâ, Tome 20 (2023) no. 1, pp. 100-109
Voir la notice de l'article provenant de la source Math-Net.Ru
In this paper, we propose generic polynomial algorithms for the knapsack problems over semigroups of non-negative integer matrices of arbitrary order and semigroup of non-negative second-order integer matrices with determinant 1.
Keywords:
generic complexity, knapsack problems
Mots-clés : integer matrices.
Mots-clés : integer matrices.
@article{SEMR_2023_20_1_a2,
author = {A. N. Rybalov},
title = {Generic polynomial algorithms for the knapsack problem in some matrix semigroups},
journal = {Sibirskie \`elektronnye matemati\v{c}eskie izvesti\^a},
pages = {100--109},
publisher = {mathdoc},
volume = {20},
number = {1},
year = {2023},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/SEMR_2023_20_1_a2/}
}
TY - JOUR AU - A. N. Rybalov TI - Generic polynomial algorithms for the knapsack problem in some matrix semigroups JO - Sibirskie èlektronnye matematičeskie izvestiâ PY - 2023 SP - 100 EP - 109 VL - 20 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/SEMR_2023_20_1_a2/ LA - ru ID - SEMR_2023_20_1_a2 ER -
A. N. Rybalov. Generic polynomial algorithms for the knapsack problem in some matrix semigroups. Sibirskie èlektronnye matematičeskie izvestiâ, Tome 20 (2023) no. 1, pp. 100-109. http://geodesic.mathdoc.fr/item/SEMR_2023_20_1_a2/