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
  • 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. 
    1 Citations
    Hardness of approximating the weight enumerator of a binary linear code
    • M. Vyalyi
    • Mathematics, Computer Science
    • ArXiv
    • 2003
    • 8

    References

    SHOWING 1-10 OF 19 REFERENCES
    Quantum Computation and Quadratically Signed Weight Enumerators
    • 19
    • PDF
    The Computational Complexity of ({\it XOR, AND\/})-Counting Problems
    • 40
    Quantum Complexity Theory
    • 835
    • Highly Influential
    Gap-Definable Counting Classes
    • 129
    Resilient Quantum Computation
    • 324
    • PDF
    The Theory of Error-Correcting Codes
    • 7,175
    • PDF
    Theory of Error-correcting Codes
    • 3,786
    • PDF
    Classical and Quantum Computation
    • 879
    • PDF
    Kitaev
    • Quantum computations: algorithms and error correction, Uspekhi Mat. Nauk 52 (1997), no. 6, 53–112; English transl., Russian Math. Surveys 52
    • 1997