A Dichotomy Theorem for Polynomial Evaluation - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

A Dichotomy Theorem for Polynomial Evaluation

(1) , (1)
1

Abstract

A dichotomy theorem for counting problems due to Creignou and Hermann states that or any nite set S of logical relations, the counting problem #SAT(S) is either in FP, or #P-complete. In the present paper we show a dichotomy theorem for polynomial evaluation. That is, we show that for a given set S, either there exists a VNP-complete family of polynomials associated to S, or the associated families of polynomials are all in VP. We give a concise characterization of the sets S that give rise to "easy" and "hard" polynomials. We also prove that several problems which were known to be #P-complete under Turing reductions only are in fact #P-complete under many-one reductions.
Fichier principal
Vignette du fichier
dichotomy_theorem_version_longue.pdf (225.01 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

ensl-00360974 , version 1 (12-02-2009)
ensl-00360974 , version 2 (15-12-2009)

Identifiers

Cite

Irénée Briquel, Pascal Koiran. A Dichotomy Theorem for Polynomial Evaluation. Mathematical Foundations of Computer Science 2009, Aug 2009, Novy Smokovec, Slovakia. pp.187-198, ⟨10.1007/978-3-642-03816-7⟩. ⟨ensl-00360974v2⟩
79 View
189 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More