The monomial ideal membership problem and polynomial identity testing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4835 LNCS, Issue , 2007, Pages 800-811

  Arvind, V ^a   Mukhopadhyay, Partha ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; OBJECT RECOGNITION; POLYNOMIALS; PROBLEM SOLVING;

IDENTITY TESTING; MONOMIAL IDEAL MEMBERSHIP PROBLEM; POLYNOMIAL TIME ALGORITHMS;

MEMBERSHIP FUNCTIONS;

EID: 38149124741     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77120-3_69     Document Type: Conference Paper

References (15)

1. Agrawal, M., Biswas, S.: Primality and identity testing via Chinese remaindering. J. ACM 50(4), 429-443 (2003)
2. Agrawal, M., Kayal, N., Saxena, N.: Primes is in P. Annals of Mathematics 160(2), 781-793 (2004)
3. Cox, D., Little, J., O' Shea, D.: Ideals, Varieties and Algorithms. Undergraduate Text in Mathematics. Springer, Heidelberg (1992)
4. Dvir, Z., Shpilka, A.: Locally Decodable Codes with 2 queries and Polynomial Identity Testing for depth 3 circuits. In: Proc. of the 37th annual ACM Sym. on Theory of computing (2005)
5. Hermann, G.: Die Frage der endlich viel Schritte in der Theorie der Polynomideale. Math. Annalen 95, 736-788 (1926)
6. Kabanets, V., Impagliazzo, R.: Derandomization of polynomial identity tests means proving circuit lower bounds. In: Proc. of the thirty-fifth annual ACM Sym. on Theory of computing, pp. 355-364 (2003)
7. Kayal, N., Saxena, N.: Polynomial Identity Testing for Depth 3 Circuits. Computational Complexity 16(2), 115-138 (2007)
8. Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic methods for interactive proof systems. Journal of the ACM 39(4), 859-868 (1992)
9. Mayr, E.: Membership in polynomial ideals over ℚ is exponential space complete. In: Cori, R., Monien, B. (eds.) STACS 1989. LNCS, vol. 349, Springer, Heidelberg (1989)
10. Mayr, E., Meyer, A.: The complexity of word problem for commutative semigroups and polynomial ideals. Adv. Math. 46, 305-329 (1982)
11. R. Motwani and P. Raghavan. Randomized Algorithm. Cambridge (2001)
12. Ben-Or, M., Tiwari, P.: A Deterministic Algorithm For Sparse Multivariate Polynomial Interpolation. In: Proc. of the 20th annual ACM Sym. on Theory of computing, pp. 301-309 (1988)
13. Schwartz, J.T.: Fast Probabilistic algorithm for verification of polynomial identities. J. ACM 27(4), 701-717 (1980)
14. Sudan, M.: Lectures on Algebra and Computation (6.966), Lecture 12,13,14 (1998)
15. Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Proc. of the Int. Sym. on Symbolic and Algebraic Computation, pp. 216-226 (1979)