Skip to main content
Log in

Deterministic polynomial identity testing in non-commutative models

computational complexity Aims and scope Submit manuscript

Abstract.

We give a deterministic polynomial time algorithm for polynomial identity testing in the following two cases:

  1. 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. 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.)

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ran Raz.

Additional information

Manuscript received 5 September 2004

Rights and permissions

Reprints and permissions

About this article

Cite this article

Raz, R., Shpilka, A. Deterministic polynomial identity testing in non-commutative models. comput. complex. 14, 1–19 (2005). https://doi.org/10.1007/s00037-005-0188-8

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00037-005-0188-8

Keywords.

Subject classification.

Navigation