scientific article; zbMATH DE number 4108153

zbMATH Open0676.68017MaRDI QIDQ3832047FDOQ3832047

Authors: Claus Peter Schnorr 

Publication date: 1989

Title of this publication is not available (Why is that?)

Recommendations

• The multiplicative complexity of quadratic boolean forms
• The number of Boolean functions with multiplicative complexity 2
• On the multiplicative complexity of some Boolean functions
• Multiplicative complexity of some Boolean functions
• On the multiplicative complexity of quasi-quadratic Boolean functions

zbMATH Keywords

quadratic formsmultiplicative complexityboolean functiondual domain

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (23)

• A duality between Boolean functions
• Upper bounds on the multiplicative complexity of symmetric Boolean functions
• Title not available (Why is that?)
• On the complexity of Boolean functions with small number of ones
• Complexity of Linear Boolean Operators
• Diameter Versus Certificate Complexity of Boolean Functions
• On the multiplicative complexity of quasi-quadratic Boolean functions
• The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\)
• Multiplicative complexity of some Boolean functions
• The multiplicative complexity of Boolean functions on four and five variables
• On domains completely specifying Boolean functions
• Title not available (Why is that?)
• On the positive and the inversion complexity of Boolean functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of Boolean functions in different characteristics
• Multiplicative complexity of vector valued Boolean functions
• On the multiplicative complexity of Boolean functions and bitsliced higher-order masking
• Boolean functions with multiplicative complexity 3 and 4
• Title not available (Why is that?)
• Local complexity of Boolean functions
• On the multiplicative complexity of some Boolean functions
• The multiplicative complexity of quadratic boolean forms

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 Q3832047)