A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent

Details A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent

2009-02-11

arxiv.org/abs/0902.1866v1

Computer Science

Computational Complexity

11 pages

Scientific paper

We show that the permanent cannot be computed by DLOGTIME-uniform threshold
or arithmetic circuits of depth o(log log n) and polynomial size.

Affiliated with

Also associated with

No associations

Rating

A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent 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 Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-487728