New upper bounds on the Boolean circuit complexity of symmetric functions
type: Item
instance of: scholarly article
title: New upper bounds on the Boolean circuit complexity of symmetric functions
zbMATH Open document ID: 1209.68274
published in: Information Processing Letters
publication date: 2010-09-07T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5780814
zbMATH Keywords: computational complexity
zbMATH Keywords: Boolean circuit complexity
zbMATH Keywords: upper bounds
zbMATH Keywords: symmetric functions
zbMATH Keywords: modular functions
author: Evgeny Demenkov
author: Arist Kojevnikov
author: Alexander S. Kulikov
author: Grigory Yaroslavtsev
MaRDI profile type: Publication
full work available at URL: j.ipl.2010.01.007
OpenAlex ID: W2009341260
cites work: A Boolean function requiring 3n network size
cites work: On the combinational complexity of certain symmetric Boolean functions
cites work: Q4708583
cites work: A $4n$ Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions
DOI: 10.1016/J.IPL.2010.01.007
description: scientific article; zbMATH DE number 5780814