More on noncommutative polynomial identity testing

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2005, Pages 92-99

  Bogdanov, Andrej ^b   Wee, Hoeteck ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC BRANCHING PROGRAMME (ABP); NONCOMMUTATIVE MODEL; NONCOMMUTATIVE POLYNOMIAL IDENTITY TESTING; POLYNOMIAL IDENTITY TESTING;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS;

POLYNOMIALS;

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

References (14)

1. S. A. Amistur and J. Levitzki. Minimal identities for algebras. In Proceedings of the of the American Mathematical Society, volume 1, pages 449-463, 1950.
2. A. Bogdanov and H. Wee. A stateful implementation of a random function supporting parity queries over hypercubes. In Proceedings of the 8th International Workshop on Randomization and Computation (RANDOM), pages 298-309, 2004.
3. R. Brent, D. Kuck, and K. Maruyama. The parallel evaluation of arithmetic expressions without division. IEEE Transactions on Computers, C-22:532-534, 1973.
4. R. P. Brent. The parallel evaluation of general arithmetic expressions. Journal of the ACM, 21(2):201-206, 1974.
5. S. Chien and A. Sinclair. Algebras with polynomial identities and computing the determinant In Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, 2004.
6. V. Drensky and E. Formanek. Polynomial Identity Rings. Advanced Courses in Mathematics - CRM Barcelona. Birkhauser, 2004.
7. V. Kabanets and R. Impagliazzo. Derandomizing polynomial identity tests means proving circuit lower bounds. In Proceedings of the 35th ACM Symposium on Theory of Computing, pages 355-364, 2003.
8. K. Maruyama. The parallel evaluation of matrix expressions. Technical Report RC 4380, IBM Research Center, Yorktown Heights, New York, May 1973.
9. N. Nisan. Lower bounds for non-commutative computation. In Proceedings of the 23rd ACM Symposium on Theory of Computing, pages 410-418, 1991.
10. R. Raz and A. Shpilka. Deterministic polynomial identity testing in non commutative models. In Proceedings of the 17th Conference on Computational Complexity, pages 215-222, 2004.
11. L. H. Rowen. Polynomial Identities in Ring Theory. Academic Press, 1980.
12. J. T. Schwanz. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM, 27(4):701-717, 1980.
13. M. Sudan. Lecture notes on algebra, http://theory.lcs.mit.edu/~madhu/ FT01/scribe/algebra.ps, September 2001.
14. R. E. Zippel. Probabilistic algorithms for sparse polynomials. In Proceedings of EUROSAM 79, pages 216-226, 1979.