On the Complexity of Computing Two Nonlinearity Measures

DOI10.1007/978-3-319-06686-8_13zbMath1407.68218arXiv1403.0417OpenAlexW4232053597MaRDI QIDQ4981157

Magnus Gausdal Find

Publication date: 24 June 2014

Published in: Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.0417

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Upper bounds on the multiplicative complexity of symmetric Boolean functions ⋮ The multiplicative complexity of 6-variable Boolean functions ⋮ Boolean functions with multiplicative complexity 3 and 4

This page was built for publication: On the Complexity of Computing Two Nonlinearity Measures