On algorithmic complexity of finding the residue of division by a power of 2 of the weight of a Boolean function defined by a polynomial
From MaRDI portal
Publication:493723
DOI10.3103/S0278641907010049zbMath1338.68118OpenAlexW2046588625MaRDI QIDQ493723
Publication date: 4 September 2015
Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3103/s0278641907010049
This page was built for publication: On algorithmic complexity of finding the residue of division by a power of 2 of the weight of a Boolean function defined by a polynomial