A comparison of Zeroes and Ones of a Boolean Polynomial

Details A comparison of Zeroes and Ones of a Boolean Polynomial A comparison of Zeroes and Ones of a Boolean Polynomial

2001-11-20

arxiv.org/abs/cs/0111052v1

Computer Science

Computational Complexity

LaTeX2e, 6 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A comparison of Zeroes and Ones of a Boolean Polynomial does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A comparison of Zeroes and Ones of a Boolean Polynomial, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A comparison of Zeroes and Ones of a Boolean Polynomial will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-275060