A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas
2016
Computational Complexity
In this paper we give subexponential size hitting sets for bounded depth multilinear arithmetic formulas. Using the known relation between black-box PIT and lower bounds we obtain lower bounds for these models. For depth-3 multilinear formulas, of size exp(n δ ), we give a hitting set of size exp Õ n 2/3+2δ/3 . This implies a lower bound of exp(Ω(n 1/2 )) for depth-3 multilinear formulas, for some explicit polynomial. For depth-4 multilinear formulas, of size exp(n δ ), we give a hitting set of
doi:10.1007/s00037-016-0131-1
fatcat:m55ugwfj6jbm5gqqirfxszw5le