Anton V. Bukhman

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper, we show that checking some properties of Boolean functions which are given by the lists of monomials in their polynomial representations can be implemented in polynomial time. Multi-linear polynomials over GF(2) are often a convenient way to represent Boolean functions. There is a single polynomial for each Boolean function, and the length of(More)
  • 1