A Dichotomy Theorem for Polynomial Evaluation

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00360974
Contributor : Irénée Briquel <>
Submitted on : Tuesday, December 15, 2009 - 2:07:26 AM
Last modification on : Thursday, February 7, 2019 - 4:52:49 PM
Long-term archiving on : Thursday, September 23, 2010 - 10:51:19 AM

Files

dichotomy_theorem_version_long...
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

125

Files downloads

175