Geodesic
Decision problems for some classes of integer partitions and number multisets
Zapiski Nauchnykh Seminarov POMI, Representation theory, dynamical systems, combinatorial methods. Part XVIII, Tome 378 (2010), pp. 171-183

Voir la notice de l'article provenant de la source Math-Net.Ru

We show that the class of integer partitions that cannot be represented as convex combinations of two partitions of the same number coincides with the class of knapsack partitions and the class of Sidon multisets, which includes sum-free sets and standard Sidon sets. The decision problem for knapsack partitions is proved to be co-$NP$-complete, and, therefore, it cannot be solved in polynomial time unless $P=NP$. Bibl. 13 titles. 
@article{ZNSL_2010_378_a10,
     author = {V. A. Shlyk},
     title = {Decision problems for some classes of integer partitions and number multisets},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {171--183},
     publisher = {mathdoc},
     volume = {378},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2010_378_a10/}
}
TY  - JOUR
AU  - V. A. Shlyk
TI  - Decision problems for some classes of integer partitions and number multisets
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2010
SP  - 171
EP  - 183
VL  - 378
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2010_378_a10/
LA  - ru
ID  - ZNSL_2010_378_a10
ER  - 
%0 Journal Article
%A V. A. Shlyk
%T Decision problems for some classes of integer partitions and number multisets
%J Zapiski Nauchnykh Seminarov POMI
%D 2010
%P 171-183
%V 378
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZNSL_2010_378_a10/
%G ru
%F ZNSL_2010_378_a10
V. A. Shlyk. Decision problems for some classes of integer partitions and number multisets. Zapiski Nauchnykh Seminarov POMI, Representation theory, dynamical systems, combinatorial methods. Part XVIII, Tome 378 (2010), pp. 171-183. http://geodesic.mathdoc.fr/item/ZNSL_2010_378_a10/