Deterministic polynomial identity testing in non commutative models

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 19, Issue , 2004, Pages 215-222

  Raz, Ran ^a   Shpilka, Amir ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; FUNCTIONS; THEOREM PROVING;

ARITHMETIC CIRCUITS; COMMUTING VARIABLES; NON COMMUTATIVE MODELS;

POLYNOMIALS;

EID: 4944248533     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. Russell Impagliazzo and Valentine Kabanets. Derandomizmg polynomial identity tests means proving circuit lower bounds. In STOC, 2003. to appear.
2. Noam Nisan. Lower bounds for non-commutative computation. In Baruch Awerbuch, editor, Proceedings of the 23rd Annual ACM Symposium on the Theory of Computing, pages 410-418, New Orleans, LS, May 1991. ACM Press.
3. Noam Nisan and Avi Wigderson. Lower bound on arithmetic circuits via partial derivatives. Computational Complexity, 6:217-234, 1996.
4. Jacob T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM, 27(4):701-717, 1980.
5. Amir Shpilka and Avi Wigderson. Depth-3 arithmetic formulae over fields of characteristic zero. Computational Complexity, 10(1): 1-27, 2001.
6. Richard Zippel. Probabilistic algorithms for sparse polynomials. In Symbolic and algebraic computation (EUROSAM '79, Internat. Sympos., Marseille, 1979), pages 216-226. Springer, Berlin, 1979.
7. Stephan Waack. On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams, em STACS 1997: 201-212