The Complexity of Bounded Register and Skew Arithmetic Computation

Computing and Combinatorics

“…As we are unable to show such results, we consider a somewhat weaker universal 2-register SLP model and show exponential size lower bounds for a polynomial that has αβα circuits of polynomial size. Due to page limit, we omit several proofs in this conference version and we refer to ECCC version of the paper [AR14] for the full proofs.…”