Oliver Tuma

Exponential-Scale Complexity of Fully Determinant-Symmetric Arithmetic Circuits: Oriented Minors, Residual Alternating Cores, and a Point-Anchor Threshold

Symmetric arithmetic circuits require specified symmetries of the input variables to extend to automorphisms of the computation. For the determinant, polynomial-size symmetric circuits are known under simultaneous row and column permutations, whereas exponential lower bounds are...

Exponential-Scale Complexity of Fully Determinant-Symmetric Arithmetic Circuits: Oriented Minors, Residual Alternating Cores, and a Point-Anchor Threshold

Symmetric arithmetic circuits require specified symmetries of the input variables to extend to automorphisms of the computation. For the determinant, polynomial-size symmetric circuits are known under simultaneous row and column permutations, whereas exponential lower bounds are...