On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
type: Item
instance of: scholarly article
title: On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
zbMATH Open document ID: 1058.94027
DOI: 10.1016/S0304-3975(99)00182-6
author: D. Pochuev
author: Joan Boyar
author: René Peralta
published in: Theoretical Computer Science
publication date: 2000-06-04T00:00:00Z
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 06E30
zbMATH DE Number: 1454433
MaRDI profile type: Publication
Wikidata QID: Q62472235
cites work: Short Discreet Proofs
cites work: Q4331740
cites work: Q3994882
cites work: Q4320535
cites work: The multiplicative complexity of quadratic boolean forms
cites work: Bounds to Complexities of Networks for Sorting and for Switching
cites work: Q3206314
cites work: Q4138138
cites work: On the combinational complexity of certain symmetric Boolean functions
cites work: Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
cites work: Q3762226
full work available at URL: s0304-3975(99)00182-6
OpenAlex ID: W2091423939
description: scientific article; zbMATH DE number 1454433