On Lower Bounds for Constant Width Arithmetic Circuits

Details On Lower Bounds for Constant Width Arithmetic Circuits On Lower Bounds for Constant Width Arithmetic Circuits

2009-07-22

arxiv.org/abs/0907.3780v2

Computer Science

Computational Complexity

16 pages

Scientific paper

The motivation for this paper is to study the complexity of constant-width arithmetic circuits. Our main results are the following. 1. For every k > 1, we provide an explicit polynomial that can be computed by a linear-sized monotone circuit of width 2k but has no subexponential-sized monotone circuit of width k. It follows, from the definition of the polynomial, that the constant-width and the constant-depth hierarchies of monotone arithmetic circuits are infinite, both in the commutative and the noncommutative settings. 2. We prove hardness-randomness tradeoffs for identity testing constant-width commutative circuits analogous to [KI03,DSY08].

Affiliated with

Also associated with

No associations

Rating

On Lower Bounds for Constant Width Arithmetic Circuits 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 On Lower Bounds for Constant Width Arithmetic Circuits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Lower Bounds for Constant Width Arithmetic Circuits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-127971