16 citations · 35 across the 16 of their papers we have counts for
1 paper · 2 filters
M. N. Vyalyi
In this paper we consider the computational complexity of the following problem. Let f be a Boolean polynomial. What value of f, 0 or 1, is taken more frequently? The problem i…