{"title":"On the complexity of monotone circuits for threshold symmetric Boolean functions","authors":"I. Sergeev","doi":"10.1515/dma-2021-0031","DOIUrl":null,"url":null,"abstract":"Abstract The complexity of implementation of a threshold symmetric n-place Boolean function with threshold k = O(1) via circuits over the basis {∨, ∧} is shown not to exceed 2 log2 k ⋅ n + o(n). Moreover, the complexity of a threshold-2 function is proved to be 2n + Θ( n $\\begin{array}{} \\sqrt n \\end{array} $), and the complexity of a threshold-3 function is shown to be 3n + O(log n), the corresponding lower bounds are put forward.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/dma-2021-0031","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
Abstract The complexity of implementation of a threshold symmetric n-place Boolean function with threshold k = O(1) via circuits over the basis {∨, ∧} is shown not to exceed 2 log2 k ⋅ n + o(n). Moreover, the complexity of a threshold-2 function is proved to be 2n + Θ( n $\begin{array}{} \sqrt n \end{array} $), and the complexity of a threshold-3 function is shown to be 3n + O(log n), the corresponding lower bounds are put forward.
期刊介绍:
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.