Hitting sets for multilinear read-once algebraic branching programs, in any order

@inproceedings{Forbes2014HittingSF,
  title={Hitting sets for multilinear read-once algebraic branching programs, in any order},
  author={Michael A. Forbes and Ramprasad Saptharishi and Amir Shpilka},
  booktitle={STOC},
  year={2014}
}
We give deterministic black-box polynomial identity testing algorithms for multilinear read-once oblivious algebraic branching programs (ROABPs), in nO(log2 n) time. Further, our algorithm is oblivious to the order of the variables. This is the first sub-exponential time algorithm for this model. Furthermore, our result has no known analogue in the model of read-once oblivious boolean branching programs with unknown order. We obtain our results by recasting, and improving upon, the ideas of… CONTINUE READING
Highly Cited
This paper has 38 citations. REVIEW CITATIONS