A Dichotomy Theorem for Polynomial Evaluation

Details A Dichotomy Theorem for Polynomial Evaluation A Dichotomy Theorem for Polynomial Evaluation

2009-02-13

arxiv.org/abs/0902.2300v2

Dans Mathematical Foundations of Computer Science 2009 - Mathematical Foundations of Computer Science 2009, Novy Smokovec : Sl

Computer Science

Computational Complexity

Scientific paper

10.1007/978-3-642-03816-7

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.

Affiliated with

Also associated with

No associations

Rating

A Dichotomy Theorem for Polynomial Evaluation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Dichotomy Theorem for Polynomial Evaluation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Dichotomy Theorem for Polynomial Evaluation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-357338