New results on noneommutative and commutative polynomial identity testing

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2008, Pages 268-279

  Arvind, V ^a   Mukhopadhyay, Partha ^a   Srinivasan, Srikanth ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

NEW RESULTS; NONCOMMUTATIVE POLYNOMIAL IDENTITY TESTING; POLYNOMIAL IDENTITY TESTING;

COMPUTATIONAL COMPLEXITY;

EID: 51749095947     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2008.22     Document Type: Conference Paper

References (19)

1. M. AGRAWAL AND S. BISWAS. Primality and identity testing via Chinese remaindering. J. ACM., 50(4):429-443, 2003.
2. S.A AMITSUR AND J. LEVITZKI. Minimal Identities for algebras. In Proceedings of the American Mathematical Society., volume 1, pages 449-463, 1950.
3. M.F. ATIYAH AND I.G. MACDONALD. Introduction to commutative algebra. Addison-Wesley Publishing Company, 1969.
4. V. ARVIND AND P. MUKHOPADHYAY The Monomial Ideal Membership problem and Polynomial Identity Testing. Proceedings ISAAC 2007, Lecture Notes in Computer Science, vol. 4835, pages 800-811, Springer 2007. Full version available as ECCC technical report TR07-095.
5. V. ARVIND, P. MUKHOPADHYAY AND S. SRINIVASAN New results on Noncommutative and Commutative Polynomial Identity Testing. ECCC report TR08-025, 2008.
6. A. BOGDANOV AND H. WEE More on Non-commutative Polynomial Identity Testing. Proc. of the 20th Annual Conference on Computational Complexity, pp. 92-99, 2005.
7. Z. DVIR AND A. SHPILKA. Locally Decodable Codes with 2 queries and Polynomial Identity Testing for depth 3 circuits. Proc. of the 37th annual ACM Sym. on Theory of computing., 2005.
8. J.E. HOPCROFT AND J.D. ULLMAN Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979.
9. V. KABANETS AND R. IMPAGLIAZZO. Deran-domization of polynomial identity tests means proving circuit lower bounds. Proc. of the thirty-fifth annual ACM Sym. on Theory of computing., pages 355-364, 2003.
10. NEERAJ KAYAL, NITIN SAXENA, On the Ring Isomorphism and Automorphism Problems. IEEE Conference on Computational Complexity, 2-12, 2005.
11. N. KAYAL AND N. SAXENA. Polynomial Identity Testing for Depth 3 Circuits. Computational Complexity., 16(2):115-138, 2007.
12. B R. MACDONALD. Finite Rings with Identity. Marcel Dekker, INC. New York, 1974.
13. R. MOTWANI AND P. RAGHAVAN. Randomized Algorithms. Cambridge University Press., 1995.
14. N. NISAN. Lower bounds for non-commutative computation. Proc. of the 23rd annual ACM Sym. on Theory of computing., pages 410-418, 1991.
15. M. BEN-OR AND P. TIWARI. A Deterministic Algorithm For Sparse Multivariate Polynomial Interpolation. Proc. of the 20th annual ACM Sym. on Theory of computing., pages 301-309, 1988.
16. R. RAZ AND A. SHPILKA. Deterministic polynomial identity testing in non commutative models. Computational Complexity., 14(1):1-19, 2005.
17. JACOB T. SCHWARTZ. Fast Probabilistic algorithm for verification of polynomial identities. J. ACM., 27(4), pages 701-717, 1980.
18. HOWARD STRAUBING. Finite automata, formal logic, and circuit complexity. Progress in Theoretical Computer Science. Birkhuser Boston Inc., Boston, MA, 1994.
19. R. ZIPPEL. Probabilistic algorithms for sparse polynomials. Proc. of the Int. Sym. on Symbolic and Algebraic Computation., pages 216-226, 1979.