The relationship between multiplicative complexity and nonlinearity

DOI10.1007/978-3-662-44465-8_12MaRDI QIDQ2922602zbMATH OpenOpenAlexFDO

Authors Joan Boyar, Magnus Find

Publication date 14 October 2014

Published in Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-44465-8_12

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Recommendations

• Multiplicative complexity of vector valued Boolean functions
• On the Complexity of Computing Two Nonlinearity Measures
• On various nonlinearity measures for Boolean functions
• Multiplicative complexity of some Boolean functions
• Four measures of nonlinearity

Cited in

(4)

• Multiplicative complexity of vector valued Boolean functions
• On the decision tree complexity of threshold functions
• On various nonlinearity measures for Boolean functions
• On the Complexity of Computing Two Nonlinearity Measures

This page was built for publication: The relationship between multiplicative complexity and nonlinearity

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