TY - JOUR

T1 - Deterministic polynomial identity testing in non-commutative models

AU - Raz, Ran

AU - Shpilka, Amir

PY - 2005/4

Y1 - 2005/4

N2 - We give a deterministic polynomial time algorithm for polynomial identity testing in the following two cases: 1. Non-commutative arithmetic formulas: The algorithm gets as an input an arithmetic formula in the non-commuting variables x1,•••,xn and determines whether or not the output of the formula is identically 0 (as a formal expression). 2. Pure arithmetic circuits: The algorithm gets as an input a pure set-multilinear arithmetic circuit (as defined by Nisan and Wigderson) in the variables x1,•••,xn and determines whether or not the output of the circuit is identically 0 (as a formal expression). One application is a deterministic polynomial time identity testing for set-multilinear arithmetic circuits of depth 3. We also give a deterministic polynomial time identity testing algorithm for non-commutative algebraic branching programs as defined by Nisan. Finally, we obtain an exponential lower bound for the size of pure setmultilinear arithmetic circuits for the permanent and for the determinant. (Only lower bounds for the depth of pure circuits were previously known.).

AB - We give a deterministic polynomial time algorithm for polynomial identity testing in the following two cases: 1. Non-commutative arithmetic formulas: The algorithm gets as an input an arithmetic formula in the non-commuting variables x1,•••,xn and determines whether or not the output of the formula is identically 0 (as a formal expression). 2. Pure arithmetic circuits: The algorithm gets as an input a pure set-multilinear arithmetic circuit (as defined by Nisan and Wigderson) in the variables x1,•••,xn and determines whether or not the output of the circuit is identically 0 (as a formal expression). One application is a deterministic polynomial time identity testing for set-multilinear arithmetic circuits of depth 3. We also give a deterministic polynomial time identity testing algorithm for non-commutative algebraic branching programs as defined by Nisan. Finally, we obtain an exponential lower bound for the size of pure setmultilinear arithmetic circuits for the permanent and for the determinant. (Only lower bounds for the depth of pure circuits were previously known.).

KW - Arithmetic branching programs

KW - Non-commutative formulas

KW - Polynomial identity testing

UR - http://www.scopus.com/inward/record.url?scp=18244365341&partnerID=8YFLogxK

U2 - 10.1007/s00037-005-0188-8

DO - 10.1007/s00037-005-0188-8

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:18244365341

SN - 1016-3328

VL - 14

SP - 1

EP - 19

JO - Computational Complexity

JF - Computational Complexity

IS - 1

ER -