Object

Title: On the Quantitative Description of Subset Partitions of theMultidimensional Binary Cube

Co-author(s) :

Aslanyan Levon ; Ryazanov Vladimir

Abstract:

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

Identifier:

oai:noad.sci.am:136223

URL:


Affiliation:

Institute for Informatics and Automation Problems of NAS RA ; Computer Center of FederalResearch Center CSC RASMoscow, Russia

Country:

Armenia

Year:

2019

Time period:

September 23-27

Conference title:

CSIT Conference 2019

Place:

Yerevan, Armenia

Object collections:

Last modified:

May 3, 2021

In our library since:

May 3, 2021

Number of object content hits:

3

All available object's versions:

https://noad.sci.am/publication/149788

Show description in RDF format:

RDF

Show description in OAI-PMH format:

OAI-PMH

This page uses 'cookies'. More information