On the Structure of Valiant's Complexity Classes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 1999

On the Structure of Valiant's Complexity Classes


In Valiant developed an algebraic analogue of the theory of NP-completeness for computations of polynomials over a field. We further develop this theory in the spirit of structural complexity and obtain analogues of well-known results by Baker, Gill, and Solovay, Ladner, and Schöning.\par We show that if Valiant's hypothesis is true, then there is a p-definable family, which is neither p-computable nor \textitVNP-complete. More generally, we define the posets of p-degrees and c-degrees of p-definable families and prove that any countable poset can be embedded in either of them, provided Valiant's hypothesis is true. Moreover, we establish the existence of minimal pairs for \textitVP in \textitVNP.\par Over finite fields, we give a \emphspecific example of a family of polynomials which is neither \textitVNP-complete nor p-computable, provided the polynomial hierarchy does not collapse.\par We define relativized complexity classes VP^h and VNP^h and construct complete families in these classes. Moreover, we prove that there is a p-family h satisfying VP^h = VNP^h.
Fichier principal
Vignette du fichier
dm030301.pdf (200.09 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00958928 , version 1 (13-03-2014)



Peter Bürgisser. On the Structure of Valiant's Complexity Classes. Discrete Mathematics and Theoretical Computer Science, 1999, Vol. 3 no. 3 (3), pp.73-94. ⟨10.46298/dmtcs.260⟩. ⟨hal-00958928⟩


79 View
926 Download



Gmail Facebook X LinkedIn More