{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:29:14Z","timestamp":1775096954850,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642141645","type":"print"},{"value":"9783642141652","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_35","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T13:26:02Z","timestamp":1278336362000},"page":"408-419","source":"Crossref","is-referenced-by-count":23,"title":["On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors"],"prefix":"10.1007","author":[{"given":"Amir","family":"Shpilka","sequence":"first","affiliation":[]},{"given":"Ilya","family":"Volkovich","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"35_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-004-0182-6","volume":"13","author":"V. Kabanets","year":"2004","unstructured":"Kabanets, V., Impagliazzo, R.: Derandomizing polynomial identity tests means proving circuit lower bounds. Computational Complexity\u00a013(1-2), 1\u201346 (2004)","journal-title":"Computational Complexity"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Shpilka, A., Volkovich, I.: Read-once polynomial identity testing. In: Proceedings of the 40th Annual STOC, pp. 507\u2013516 (2008)","DOI":"10.1145\/1374376.1374448"},{"key":"35_CR3","volume-title":"Modern computer algebra","author":"J.v.z. Gathen","year":"1999","unstructured":"Gathen, J.v.z., Gerhard, J.: Modern computer algebra. Cambridge University Press, Cambridge (1999)"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Kaltofen, E.: Polynomial factorization: a success story. In: ISSAC, pp. 3\u20134 (2003)","DOI":"10.1145\/860854.860857"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Gathen, J.v.z.: Who was who in polynomial factorization. In: ISSAC, vol.\u00a02 (2006)","DOI":"10.1145\/1145768.1145770"},{"key":"35_CR6","unstructured":"Kayal, N.: Derandomizing some number-theoretic and algebraic algorithms. PhD thesis, Indian Institute of Technology, Kanpur, India (2007)"},{"issue":"2","key":"35_CR7","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"},{"issue":"1","key":"35_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"Mulmuley, K., Vazirani, U., Vazirani, V.: Matching is as easy as matrix inversion. Combinatorica\u00a07(1), 105\u2013113 (1987)","journal-title":"Combinatorica"},{"issue":"4","key":"35_CR9","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 algorithms for verification of polynomial identities. JACM\u00a027(4), 701\u2013717 (1980)","journal-title":"JACM"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Symbolic and algebraic computation, pp. 216\u2013226 (1979)","DOI":"10.1007\/3-540-09519-5_73"},{"issue":"4","key":"35_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0020-0190(78)90067-4","volume":"7","author":"R.A. DeMillo","year":"1978","unstructured":"DeMillo, R.A., Lipton, R.J.: A probabilistic remark on algebraic program testing. Inf. Process. Lett.\u00a07(4), 193\u2013195 (1978)","journal-title":"Inf. Process. Lett."},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Klivans, A., Spielman, D.: Randomness efficient identity testing of multivariate polynomials. In: Proceedings of the 33rd Annual STOC, pp. 216\u2013223 (2001)","DOI":"10.1145\/380752.380801"},{"issue":"4","key":"35_CR13","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. JACM\u00a050(4), 429\u2013443 (2003)","journal-title":"JACM"},{"key":"35_CR14","unstructured":"Lipton, R.J., Vishnoi, N.K.: Deterministic identity testing for multivariate polynomials. In: Proceedings of the 14th annual SODA, pp. 756\u2013760 (2003)"},{"key":"35_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/11590156_6","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"M. Agrawal","year":"2005","unstructured":"Agrawal, M.: Proving lower bounds via pseudo-random generators. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 92\u2013105. Springer, Heidelberg (2005)"},{"issue":"1","key":"35_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-005-0188-8","volume":"14","author":"R. Raz","year":"2005","unstructured":"Raz, R., Shpilka, A.: Deterministic polynomial identity testing in non commutative models. Computational Complexity\u00a014(1), 1\u201319 (2005)","journal-title":"Computational Complexity"},{"issue":"5","key":"35_CR17","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1137\/05063605X","volume":"36","author":"Z. Dvir","year":"2006","unstructured":"Dvir, Z., Shpilka, A.: Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits. SIAM J. on Computing\u00a036(5), 1404\u20131434 (2006)","journal-title":"SIAM J. on Computing"},{"issue":"2","key":"35_CR18","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"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Arvind, V., Mukhopadhyay, P.: The monomial ideal membership problem and polynomial identity testing. In: Proceedings of the 18th ISAAC, pp. 800\u2013811 (2007)","DOI":"10.1007\/978-3-540-77120-3_69"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Karnin, Z.S., Shpilka, A.: Deterministic black box polynomial identity testing of depth-3 arithmetic circuits with bounded top fan-in. In: Proceedings of the 23rd Annual CCC, pp. 280\u2013291 (2008)","DOI":"10.1109\/CCC.2008.15"},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"Saxena, N., Seshadhri, C.: An almost optimal rank bound for depth-3 identities. In: Proceedings of the 24th annual CCC (2009)","DOI":"10.1109\/CCC.2009.20"},{"issue":"4","key":"35_CR22","doi-asserted-by":"publisher","first-page":"1279","DOI":"10.1137\/080735850","volume":"39","author":"Z. Dvir","year":"2009","unstructured":"Dvir, Z., Shpilka, A., Yehudayoff, A.: Hardness-randomness tradeoffs for bounded depth arithmetic circuits. SIAM J. on Computing\u00a039(4), 1279\u20131293 (2009)","journal-title":"SIAM J. on Computing"},{"key":"35_CR23","doi-asserted-by":"crossref","unstructured":"Agrawal, M., Vinay, V.: Arithmetic circuits: A chasm at depth four. In: Proceedings of the 49th Annual FOCS, pp. 67\u201375 (2008)","DOI":"10.1109\/FOCS.2008.32"},{"key":"35_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-540-85363-3_23","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"V. Arvind","year":"2008","unstructured":"Arvind, V., Mukhopadhyay, P.: Derandomizing the isolation lemma and lower bounds for circuit size. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol.\u00a05171, pp. 276\u2013289. Springer, Heidelberg (2008)"},{"key":"35_CR25","doi-asserted-by":"crossref","unstructured":"Kayal, N., Saraf, S.: Blackbox polynomial identity testing for depth 3 circuits. Electronic Colloquium on Computational Complexity (ECCC), (32) (2009)","DOI":"10.1109\/FOCS.2009.67"},{"key":"35_CR26","doi-asserted-by":"crossref","unstructured":"Shpilka, A., Volkovich, I.: Improved polynomial identity testing for read-once formulas. In: APPROX-RANDOM, pp. 700\u2013713 (2009)","DOI":"10.1007\/978-3-642-03685-9_52"},{"key":"35_CR27","doi-asserted-by":"crossref","unstructured":"Karnin, Z.S., Mukhopadhyay, P., Shpilka, A., Volkovich, I.: Deterministic identity testing of depth 4 multilinear circuits with bounded top fan-in. In: Proceedings of the 42th Annual STOC (2010)","DOI":"10.1145\/1806689.1806779"},{"key":"35_CR28","doi-asserted-by":"crossref","unstructured":"Saxena, N., Seshadhri, C.: From sylvester-gallai configurations to rank bounds: Improved black-box identity test for depth-3 circuits. Electronic Colloquium on Computational Complexity (ECCC) (013) (2010)","DOI":"10.1109\/FOCS.2010.9"},{"key":"35_CR29","doi-asserted-by":"crossref","unstructured":"Heintz, J., Schnorr, C.P.: Testing polynomials which are easy to compute (extended abstract). In: Proceedings of the 12th annual STOC, pp. 262\u2013272 (1980)","DOI":"10.1145\/800141.804674"},{"key":"35_CR30","doi-asserted-by":"crossref","unstructured":"Raz, R.: Multi-linear formulas for permanent and determinant are of super-polynomial size. In: Proceedings of the 36th Annual STOC, pp. 633\u2013641 (2004)","DOI":"10.1145\/1007352.1007353"},{"key":"35_CR31","unstructured":"Raz, R.: Multilinear NC 1\u2009\u2260 Multilinear NC 2. In: Proceedings of the 45th Annual FOCS, pp. 344\u2013351 (2004)"},{"issue":"4","key":"35_CR32","doi-asserted-by":"publisher","first-page":"1624","DOI":"10.1137\/070707932","volume":"38","author":"R. Raz","year":"2008","unstructured":"Raz, R., Shpilka, A., Yehudayoff, A.: A lower bound for the size of syntactically multilinear arithmetic circuits. SIAM J. on Computing\u00a038(4), 1624\u20131647 (2008)","journal-title":"SIAM J. on Computing"},{"key":"35_CR33","doi-asserted-by":"crossref","unstructured":"Raz, R., Yehudayoff, A.: Lower bounds and separations for constant depth multilinear circuits. In: IEEE Conference on Computational Complexity, pp. 128\u2013139 (2008)","DOI":"10.1109\/CCC.2008.8"},{"key":"35_CR34","doi-asserted-by":"crossref","unstructured":"Hancock, T.R., Hellerstein., L.: Learning read-once formulas over fields and extended bases. In: Proceedings of the 4th Annual COLT, pp. 326\u2013336 (1991)","DOI":"10.1016\/B978-1-55860-213-7.50033-X"},{"issue":"4","key":"35_CR35","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1137\/S009753979223664X","volume":"24","author":"N.H. Bshouty","year":"1995","unstructured":"Bshouty, N.H., Hancock, T.R., Hellerstein, L.: Learning arithmetic read-once formulas. SIAM J. on Computing\u00a024(4), 706\u2013735 (1995)","journal-title":"SIAM J. on Computing"},{"key":"35_CR36","doi-asserted-by":"crossref","unstructured":"Kaltofen, E., Koiran, P.: On the complexity of factoring bivariate supersparse (lacunary) polynomials. In: ISSAC, pp. 208\u2013215 (2005)","DOI":"10.1145\/1073884.1073914"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T16:31:13Z","timestamp":1740241873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}