Geometry of Translations on a Boolean Cube
- 作者: Vyalyi M.N.1,2,3, Leontiev V.K.1
-
隶属关系:
- Dorodnitsyn Computing Center of the Russian Academy of Sciences
- Moscow Institute of Physics and Technology (State University)
- National Research University-Higher School of Economics
- 期: 卷 55, 编号 2 (2019)
- 页面: 152-173
- 栏目: Large Systems
- URL: https://journal-vniispk.ru/0032-9460/article/view/166595
- DOI: https://doi.org/10.1134/S0032946019020042
- ID: 166595
如何引用文章
详细
The operation of Minkowski addition of geometric figures has a discrete analog, addition of subsets of a Boolean cube viewed as a vector space over the two-element field. Subsets of the Boolean cube (or multivariable Boolean functions) form a monoid with respect to this operation. This monoid is of interest in classical discrete analysis as well as in a number of problems related to information theory. We consider several complexity aspects of this monoid, namely structural, algorithmic, and algebraic.
作者简介
M. Vyalyi
Dorodnitsyn Computing Center of the Russian Academy of Sciences; Moscow Institute of Physics and Technology (State University); National Research University-Higher School of Economics
编辑信件的主要联系方式.
Email: vyalyi@gmail.com
俄罗斯联邦, Moscow; Moscow; Moscow
V. Leontiev
Dorodnitsyn Computing Center of the Russian Academy of Sciences
编辑信件的主要联系方式.
Email: vkleontiev@yandex.ru
俄罗斯联邦, Moscow
补充文件
