Aslanyan Levon ; Ryazanov Vladimir
In this paper, the problem of the quantitative description of partitions (QDP) of arbitrary ����-subsets of the ����-dimensional unit cube is considered for a given ����, 0 ≤ ���� ≤ 2����. It is shown that QDP can be reduced to the case of those subsets of �������� corresponding to monotone Boolean functions. NPhardness of the problem is proved
oai:noad.sci.am:136223
Institute for Informatics and Automation Problems of NAS RA ; Computer Center of FederalResearch Center CSC RASMoscow, Russia
May 3, 2021
May 3, 2021
17
https://noad.sci.am/publication/149788
Edition name | Date |
---|---|
Sahakyan Hasmik, On the Quantitative Description of Subset Partitions of theMultidimensional Binary Cube | May 3, 2021 |
Sahakyan Hasmik Ryazanov Vladimir Margaryan Ani
Sahakyan Hasmik Margaryan Ani
Sahakyan Hasmik Aslanyan Levon