Abstract
One of the fastest known general techniques for computing permanents is Ryser’s formula. On this note, we show that this formula over Sylvester Hadamard matrices of order 2m, Hm, can be carried out by enumerating m-variable Boolean functions with an arbitrary Walsh spectrum. As a consequence, the quotient per(Hm)/22m might be a measure of the “density” of m-variable Boolean functions with high nonlinearity.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference18 articles.
1. Bent Functions: Results and Applications to Cryptography;Tokareva,2015
2. The complexity of computing the permanent
3. P≟NP Chapter 3 in Open Problems in Mathematics;Aaronson,2016
4. Permanents;Minc,1978
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献