Publication View

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

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.. Comment: 11 pages

Publication details
Download http://arxiv.org/abs/0902.1866
Repository arXiv (United States)
Keywords Computer Science - Computational Complexity
Type text