Abstract
Valiant developed a nonuniform algebraic analogue of the theory of NP-completeness for computations with polynomials over a field k in (Valiant, Proceedings of the 11th ACM STOC, 1979, pp. 249–261; Logic Algorithmic: An International Symposium held in honor of Ernst Specker, Vol. 30, 1982, pp. 365–380). This theory centers around his hypothesis VP k≠ VNP k , the analogue of Cook's hypothesis P≠ NP . We identify the Boolean parts of Valiant's algebraic complexity classes VP k and VNP k as familiar nonuniform complexity classes. As a consequence, we obtain rather strong evidence for Valiant's hypothesis: if it were wrong, then the nonuniform versions of NC and PH would be equal. In particular, the polynomial hierarchy would collapse to the second level. We show this for fields of characteristic zero and finite fields; in the first case we assume a generalized Riemann hypothesis. The crucial step in our proof is the elimination of constants in k, which relies on a recent method proposed by Koiran [16].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
