Object
Title: On the Hypercube Subset Partitioning Varieties
Co-author(s) :
Aslanyan Levon ; Ryazanov Vladimir
Abstract:
In this paper, the problem of a quantitative description of partitions (QDP) of arbitrary m-subsets of the n-dimensional unit cube is considered for a given m, 0 ≤ m ≤ 2 n . A necessary condition for the existence of a given QDP-subset is achieved in terms of minimal and maximal layers that are known by earlier publications. It is shown that QDP are in a correspondence to the upper homogeneous area elements of the n-cube and to the monotone Boolean functions. The NP-hardness of the QDP problem is proved. QDP singular points on different layers of the cube are described.
Publisher:
Identifier:
oai:noad.sci.am:136194
DOI:
10.1109/CSITechnol.2019.8895211
Journal or Publication Title:
2019 Computer Science and Information Technologies (CSIT)
URL:
Affiliation:
Institute for Informatics and Automation Problems of NAS RA ; Computer Center of Federal Research Center CSC RAS
Country:
Year:
Time period:
Conference title:
2019 Computer Science and Information Technologies (CSIT)
Place:
Indexing:
Object collections:
- Digital Library > Academic Insitutions > Insitute for Informatics and Automation Problems of NAS RA > Conferences
Last modified:
May 3, 2021
In our library since:
Apr 20, 2021
Number of object content hits:
6
All available object's versions:
https://noad.sci.am/publication/149759
Show description in RDF format:
Show description in OAI-PMH format:
| Edition name | Date |
|---|---|
| Sahakyan Hasmik, On the Hypercube Subset Partitioning Varieties | May 3, 2021 |
