On the average-case complexity of Boolean functions under binomial distribution on their domains

IF 0.3 Q4 MATHEMATICS, APPLIED

Discrete Mathematics and Applications Pub Date : 2021-10-01 DOI:10.1515/dma-2021-0028

A. V. Chashkin

引用次数: 0

Abstract

Abstract Given a binomial probability distribution on the n-dimensional Boolean cube, the complexity of implementation of Boolean functions by straight line programs with conditional stop is considered. The order, as n → ∞, of the average-case complexity of almost all n-place Boolean functions is established.

查看原文本刊更多论文

二项分布布尔函数在其定义域上的平均情况复杂度

摘要给定n维布尔立方体上的二项式概率分布，考虑了带条件停止的直线程序实现布尔函数的复杂性。顺序，如n→ ∞, 建立了几乎所有n位布尔函数的平均情况复杂度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Discrete Mathematics and Applications MATHEMATICS, APPLIED-

CiteScore

0.60

自引率

20.00%

发文量

期刊介绍： The aim of this journal is to provide the latest information on the development of discrete mathematics in the former USSR to a world-wide readership. The journal will contain papers from the Russian-language journal Diskretnaya Matematika, the only journal of the Russian Academy of Sciences devoted to this field of mathematics. Discrete Mathematics and Applications will cover various subjects in the fields such as combinatorial analysis, graph theory, functional systems theory, cryptology, coding, probabilistic problems of discrete mathematics, algorithms and their complexity, combinatorial and computational problems of number theory and of algebra.