A comparison of Zeroes and Ones of a Boolean Polynomial
Computational Complexity
2007-05-23 v1
Abstract
In this paper we consider the computational complexity of the following problem. Let be a Boolean polynomial. What value of , 0 or 1, is taken more frequently? The problem is solved in polynomial time for polynomials of degrees 1,2. The next case of degree 3 appears to be PP-complete under polynomial reductions in the class of promise problems. The proof is based on techniques of quantum computation.
Keywords
Cite
@article{arxiv.cs/0111052,
title = {A comparison of Zeroes and Ones of a Boolean Polynomial},
author = {M. N. Vyalyi},
journal= {arXiv preprint arXiv:cs/0111052},
year = {2007}
}
Comments
LaTeX2e, 6 pages