TU Berlin

Fachgebiet Algorithmische AlgebraPublications

Inhalt des Dokuments

zur Navigation

Search for Publication

Suche nach Publikationen

All Publications

Cook's versus Valiant's Hypothesis
Zitatschlüssel B-Cooks-Versus-Valiants-Hypothesis
Autor Peter Bürgisser
Seiten 71-88
Jahr 2000
Journal Theor. Comp. Sci.
Jahrgang 235
Zusammenfassung In 1979 Valiant developed a nonuniform algebraic analogue of the theory of NP-completeness for computations with polynomials over a field. This theory centers around his hypothesis VP <> VNP, the analogue of Cook's hypothesis P <> NP. We identify the Boolean parts of Valiant's algebraic complexity classes VP and VNP 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 the field, which relies on a recent method developed by Koiran (1996).
Link zur Publikation Download Bibtex Eintrag



Schnellnavigation zur Seite über Nummerneingabe