activity
20132020
most citedNew Algorithms and Hard Instances for Non-Commutative Computation

1 citations · 1 across the 7 of their papers we have counts for

collaborators
Showing 2018Show all

1 paper · 1 filter

cs.CC2018

A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits

Suryajith Chillara, Christian Engels, Nutan Limaye +1

We study the size blow-up that is necessary to convert an algebraic circuit of product-depth to one of product-depth in the multilinear setting. We show that for every po…