A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Improved Explicit Hitting-Sets for ROABPs

2020
*
International Workshop on Approximation Algorithms for Combinatorial Optimization
*

We give improved explicit constructions of hitting-sets for read-once oblivious algebraic branching programs (ROABPs) and related models. For ROABPs in an unknown variable order, our hitting-set has size polynomial in (nr)^{(log n)/(max{1, log log n-log log r})}d over a field whose characteristic is zero or large enough, where n is the number of variables, d is the individual degree, and r is the width of the ROABP. A similar improved construction works over fields of arbitrary characteristic

doi:10.4230/lipics.approx/random.2020.4
dblp:conf/approx/GuoG20
fatcat:kpw3hzowtbhinh7ln4mpmnpr3y