Corpus ID: 9652952

A comparison of Zeroes and Ones of a Boolean Polynomial

@article{Vyalyi2001ACO,
  title={A comparison of Zeroes and Ones of a Boolean Polynomial},
  author={M. Vyalyi},
  journal={ArXiv},
  year={2001},
  volume={cs.CC/0111052}
}

M. Vyalyi

Published 2001

Computer Science, Mathematics

ArXiv

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed

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 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.