scientific article; zbMATH DE number 176872

MaRDI QIDQ4036703zbMATH OpenFDO

Authors R. Mirwald, Claus Peter Schnorr

Publication date 18 May 1993

zbMATH Keywords

rankmultiplicative complexityBoolean matricesKronecker normal formBoolean quadratic forms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Quadratic and bilinear forms, inner products (15A63) Boolean functions (06E30)

Recommendations

• The multiplicative complexity of quadratic boolean forms
• On the multiplicative complexity of Boolean functions
• Publication:4860274
• On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
• scientific article; zbMATH DE number 4108153

Cited in

(5)

• Multiplicative complexity of direct sums of quadratic systems
• The multiplicative complexity of quadratic boolean forms
• scientific article; zbMATH DE number 1080058 (Why is no real title available?)
• Computational problems of quadratic forms: complexity and cryptographic perspectives
• scientific article; zbMATH DE number 833769 (Why is no real title available?)

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