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

Simple item page
dc.creatorKoiran, Pascal
dc.creatorPerifel, Sylvain
dc.date2009-02-11
dc.date.accessioned2026-07-07T12:40:34Z
dc.date.available2026-07-07T12:40:34Z
dc.descriptionWe show that the permanent cannot be computed by DLOGTIME-uniform threshold or arithmetic circuits of depth o(log log n) and polynomial size.
dc.description11 pages
dc.identifierhttps://arxiv.org/abs/0902.1866
dc.identifierhttp://arxiv.org/abs/0902.1866
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/219480
dc.subjectComputational Complexity
dc.titleA Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent
dc.typetext

Files

Collections

arXiv