Upper bounds for the formula size of symmetric Boolean functions
type: Item
instance of: scholarly article
title: Upper bounds for the formula size of symmetric Boolean functions
zbMATH Open document ID: 1351.94099
DOI: 10.3103/S1066369X14050041
published in: Russian Mathematics
publication date: 2014-10-31T00:00:00Z
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 06E30
zbMATH DE Number: 6362761
zbMATH Keywords: formula size
zbMATH Keywords: symmetric Boolean functions
zbMATH Keywords: majority function
zbMATH Keywords: multiplication
author: I. S. Sergeev
MaRDI profile type: Publication
cites work: Q4692286
cites work: Q3994882
cites work: Boolean function complexity. Advances and frontiers.
cites work: Q4528867
cites work: Q5629239
cites work: $\Omega (n\log n)$ Lower Bounds on Length of Boolean Formulas
cites work: Shallow circuits and concise formulae for multiple addition and multiplication
cites work: The complexity of the realization of symmetrical functions by formulae
cites work: Q4036708
cites work: On the combinational complexity of certain symmetric Boolean functions
cites work: New upper bounds on the Boolean circuit complexity of symmetric functions
cites work: Q5670543
description: scientific article; zbMATH DE number 6362761