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

Pascal Koiran; Sylvain Perifel

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

Computational Complexity 2009-02-12 v1

Authors: Pascal Koiran , Sylvain Perifel

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.

Keywords

permanent threshold circuits lower bound DLOGTIME-uniform arithmetic circuits depth polynomial size

Cite

@article{arxiv.0902.1866,
  title  = {A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent},
  author = {Pascal Koiran and Sylvain Perifel},
  journal= {arXiv preprint arXiv:0902.1866},
  year   = {2009}
}