scientific article; zbMATH DE number 3868606

MaRDI QIDQ3334980zbMATH OpenFDO

Authors Ulrich Hedtstück

Publication date 1984

zbMATH Keywords

Aanderaa-Rosenberg conjectureargument complexity of Boolean functionsdecision algorithmdecision treesexhaustiveness of Boolean functionsk-transitivity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the multiplicative complexity of Boolean functions
• On the multiplicative complexity of some Boolean functions
• scientific article; zbMATH DE number 4108153
• Multiplicative complexity of some Boolean functions
• The complexity of the representation of multiple-output Boolean functions
• On the complexity of the evaluation of transient extensions of Boolean functions
• On the complexity of the evaluation of transient extensions of Boolean functions
• On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
• On the complexity of restrictions of Boolean functions
• scientific article; zbMATH DE number 1855658

Cited in

(2)

• On the complexity of the evaluation of transient extensions of Boolean functions
• Trans-dichotomous algorithms without multiplication — some upper and lower bounds

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3334980)