On the Complexity of Computing Two Nonlinearity Measures
From MaRDI portal
Publication:4981157
DOI10.1007/978-3-319-06686-8_13zbMath1407.68218arXiv1403.0417MaRDI QIDQ4981157
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
68Q25: Analysis of algorithms and problem complexity
94A60: Cryptography
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
The multiplicative complexity of 6-variable Boolean functions, Boolean functions with multiplicative complexity 3 and 4, Upper bounds on the multiplicative complexity of symmetric Boolean functions