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

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/219480We show that the permanent cannot be computed by DLOGTIME-uniform threshold or arithmetic circuits of depth o(log log n) and polynomial size.11 pagesComputational ComplexityA Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanenttext