The Relationship between Multiplicative Complexity and Nonlinearity

DOI10.1007/978-3-662-44465-8_12zbMath1426.68113OpenAlexW1565785789MaRDI QIDQ2922602

Joan. Boyar, Magnus Gausdal 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

Analysis of algorithms and problem complexity (68Q25) 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) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Related Items (2)

On various nonlinearity measures for Boolean functions ⋮ On the decision tree complexity of threshold functions

This page was built for publication: The Relationship between Multiplicative Complexity and Nonlinearity