6 resultados para Subset Sum Problem
em Bulgarian Digital Mathematics Library at IMI-BAS
Resumo:
2000 Mathematics Subject Classification: 91A46, 91A35.
Resumo:
Research partially supported by INTAS grant 97-1644
Resumo:
* Partialy supported by contract MM 523/95 with Ministry of Science and Technologies of Republic of Bulgaria.
Resumo:
* The research is supported partly by INTAS: 04-77-7173 project, http://www.intas.be
Resumo:
Composition problem is considered for partition constrained vertex subsets of n dimensional unit cube E^n . Generating numerical characteristics of E^n subsets partitions is considered by means of the same characteristics in 1 − n dimensional unit cube, and construction of corresponding subsets is given for a special particular case. Using pairs of lower layer characteristic vectors for E^(1-n) more characteristic vectors for E^n are composed which are boundary from one side, and which take part in practical recognition of validness of a given candidate vector of partitions.
Resumo:
2000 Mathematics Subject Classification: Primary 60G51, secondary 60G70, 60F17.