Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs

  title={Deterministic Black-Box Identity Testing \$pi\$-Ordered Algebraic Branching Programs},
  author={Maurice J. Jansen and Youming Qiao and Jayalal Sarma},
In this paper we study algebraic branching programs (ABPs) with restrictions on the order and the number of reads of variables in the program. An ABP is given by a layered directed acyclic graph with source s and sink t, whose edges are labeled by variables taken from the set {x1, x2, . . . , xn} or field constants. It computes the sum of weights of all paths from s to t, where the weight of a path is defined as the product of edge-labels on the path. Given a permutation π of the n variables… CONTINUE READING
7 Citations
25 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 25 references

Algebraic Geometry

  • R. Hartshorne
  • Graduate Texts in Mathematics, Vol 52. Springer…
  • 1977
Highly Influential
4 Excerpts

Lower bounds for syntactically multilinear algebraic branching programs

  • M. Jansen
  • Proc. 33rd International Symposium on…
  • 2008
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…