A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent
Abstract
We show that the permanent cannot be computed by DLOGTIME-uniform threshold or arithmetic circuits of depth o(log log n) and polynomial size.
- Publication:
-
arXiv e-prints
- Pub Date:
- February 2009
- DOI:
- 10.48550/arXiv.0902.1866
- arXiv:
- arXiv:0902.1866
- Bibcode:
- 2009arXiv0902.1866K
- Keywords:
-
- Computer Science - Computational Complexity
- E-Print:
- 11 pages