{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:47:18Z","timestamp":1725497238643},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77120-3_69","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:31:09Z","timestamp":1196940669000},"page":"800-811","source":"Crossref","is-referenced-by-count":7,"title":["The Monomial Ideal Membership Problem and Polynomial Identity Testing"],"prefix":"10.1007","author":[{"given":"V.","family":"Arvind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Partha","family":"Mukhopadhyay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"69_CR1","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1145\/792538.792540","volume":"50","author":"M. Agrawal","year":"2003","unstructured":"Agrawal, M., Biswas, S.: Primality and identity testing via Chinese remaindering. J. ACM\u00a050(4), 429\u2013443 (2003)","journal-title":"J. ACM"},{"issue":"2","key":"69_CR2","doi-asserted-by":"publisher","first-page":"781","DOI":"10.4007\/annals.2004.160.781","volume":"160","author":"M. Agrawal","year":"2004","unstructured":"Agrawal, M., Kayal, N., Saxena, N.: Primes is in P. Annals of Mathematics\u00a0160(2), 781\u2013793 (2004)","journal-title":"Annals of Mathematics"},{"key":"69_CR3","series-title":"Undergraduate Text in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2181-2","volume-title":"Ideals, Varieties and Algorithms","author":"D. Cox","year":"1992","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Ideals, Varieties and Algorithms. Undergraduate Text in Mathematics. Springer, Heidelberg (1992)"},{"key":"69_CR4","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/1060590.1060678"},{"key":"69_CR5","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/BF01206635","volume":"95","author":"G. Hermann","year":"1926","unstructured":"Hermann, G.: Die Frage der endlich viel Schritte in der Theorie der Polynomideale. Math. Annalen\u00a095, 736\u2013788 (1926)","journal-title":"Math. Annalen"},{"key":"69_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013364 (2003)","DOI":"10.1145\/780591.780595"},{"issue":"2","key":"69_CR7","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00037-007-0226-9","volume":"16","author":"N. Kayal","year":"2007","unstructured":"Kayal, N., Saxena, N.: Polynomial Identity Testing for Depth 3 Circuits. Computational Complexity\u00a016(2), 115\u2013138 (2007)","journal-title":"Computational Complexity"},{"issue":"4","key":"69_CR8","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1145\/146585.146605","volume":"39","author":"C. Lund","year":"1992","unstructured":"Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic methods for interactive proof systems. Journal of the ACM\u00a039(4), 859\u2013868 (1992)","journal-title":"Journal of the ACM"},{"key":"69_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029002","volume-title":"STACS 1989","author":"E. Mayr","year":"1989","unstructured":"Mayr, E.: Membership in polynomial ideals over \u211a is exponential space complete. In: Cori, R., Monien, B. (eds.) STACS 1989. LNCS, vol.\u00a0349, Springer, Heidelberg (1989)"},{"key":"69_CR10","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0001-8708(82)90048-2","volume":"46","author":"E. Mayr","year":"1982","unstructured":"Mayr, E., Meyer, A.: The complexity of word problem for commutative semigroups and polynomial ideals. Adv. Math.\u00a046, 305\u2013329 (1982)","journal-title":"Adv. Math."},{"key":"69_CR11","unstructured":"R. Motwani and P. Raghavan. Randomized Algorithm. Cambridge (2001)"},{"key":"69_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013309 (1988)","DOI":"10.1145\/62212.62241"},{"issue":"4","key":"69_CR13","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J.T. Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast Probabilistic algorithm for verification of polynomial identities. J. ACM\u00a027(4), 701\u2013717 (1980)","journal-title":"J. ACM"},{"key":"69_CR14","unstructured":"Sudan, M.: Lectures on Algebra and Computation (6.966), Lecture 12,13,14 (1998)"},{"key":"69_CR15","doi-asserted-by":"crossref","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Proc. of the Int. Sym. on Symbolic and Algebraic Computation, pp. 216\u2013226 (1979)","DOI":"10.1007\/3-540-09519-5_73"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77120-3_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:01:25Z","timestamp":1619521285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77120-3_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771180"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77120-3_69","relation":{},"subject":[]}}