Q3334980
type: Item
instance of: scholarly article
zbMATH Open document ID: 0545.68029
author: Ulrich Hedtstück
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 3868606
zbMATH Keywords: argument complexity of Boolean functions
zbMATH Keywords: decision trees
zbMATH Keywords: k-transitivity
zbMATH Keywords: Aanderaa-Rosenberg conjecture
zbMATH Keywords: decision algorithm
zbMATH Keywords: exhaustiveness of Boolean functions
MaRDI profile type: Publication
Recommended article: On the Multiplicative Complexity of Boolean Functions
Recommended article: On the multiplicative complexity of some Boolean functions
Recommended article: Q3832047
Recommended article: Multiplicative complexity of some Boolean functions
Recommended article: The complexity of the representation of multiple-output Boolean functions
Recommended article: On the complexity of the evaluation of transient extensions of Boolean functions
Recommended article: Q4964007
Recommended article: On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
Recommended article: On the complexity of restrictions of Boolean functions
Recommended article: Q4788068
description: scientific article