{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:21:20Z","timestamp":1758266480583,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":111,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T00:00:00Z","timestamp":1529452800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Google India"},{"name":"DST (DST\/SJF\/MSA-01\/2013-14)"},{"name":"Microsoft Research Lab India"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,20]]},"DOI":"10.1145\/3188745.3188760","type":"proceedings-article","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T20:15:46Z","timestamp":1529525746000},"page":"1152-1165","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Discovering the roots: uniform closure results for algebraic classes under factoring"],"prefix":"10.1145","author":[{"given":"Pranjal","family":"Dutta","sequence":"first","affiliation":[{"name":"Chennai Mathematical Institute, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nitin","family":"Saxena","sequence":"additional","affiliation":[{"name":"IIT Kanpur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Sinhababu","sequence":"additional","affiliation":[{"name":"IIT Kanpur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,6,20]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Oliver Aberth. 1973.  Oliver Aberth. 1973."},{"volume-title":"Mathematics of computation 27, 122","year":"1973","author":"Iteration","key":"e_1_3_2_2_2_1"},{"key":"e_1_3_2_2_3_1","unstructured":"Manindra Agrawal Sumanta Ghosh and Nitin Saxena. 2017.  Manindra Agrawal Sumanta Ghosh and Nitin Saxena. 2017."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188762"},{"key":"e_1_3_2_2_5_1","unstructured":"Manindra Agrawal and V Vinay. 2008.  Manindra Agrawal and V Vinay. 2008."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.32"},{"volume-title":"On the power of algebraic branching programs of width two. Automata, Languages and Programming","year":"2011","author":"Allender Eric","key":"e_1_3_2_2_7_1"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221006"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-1989-15750-9"},{"key":"e_1_3_2_2_10_1","unstructured":"Karl Bringmann Christian Ikenmeyer and Jeroen Zuiddam. 2017.  Karl Bringmann Christian Ikenmeyer and Jeroen Zuiddam. 2017."},{"volume-title":"Algebraic Branching Programs of Small Width. In 32nd Computational Complexity Conference, CCC 2017","year":"2017","author":"On","key":"e_1_3_2_2_11_1"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875589"},{"key":"e_1_3_2_2_14_1","unstructured":"Peter B\u00fcrgisser. 2001.  Peter B\u00fcrgisser. 2001."},{"volume-title":"Decision versus computation in algebraic complexity","author":"On","key":"e_1_3_2_2_15_1"},{"key":"e_1_3_2_2_16_1","unstructured":"Peter B\u00fcrgisser. 2004.  Peter B\u00fcrgisser. 2004."},{"volume-title":"Foundations of Computational Mathematics 4, 4","year":"2004","author":"The","key":"e_1_3_2_2_17_1"},{"key":"e_1_3_2_2_18_1","unstructured":"Peter B\u00fcrgisser. 2013.  Peter B\u00fcrgisser. 2013."},{"volume-title":"Springer Science &amp","author":"Vol Completeness","key":"e_1_3_2_2_19_1"},{"key":"e_1_3_2_2_20_1","unstructured":"Peter B\u00fcrgisser Michael Clausen and Amin Shokrollahi. 2013.  Peter B\u00fcrgisser Michael Clausen and Amin Shokrollahi. 2013."},{"volume-title":"Springer Science &amp","author":"Vol Algebraic","key":"e_1_3_2_2_21_1"},{"key":"e_1_3_2_2_22_1","unstructured":"Chi-Ning Chou Mrinal Kumar and Noam Solomon. 2018.  Chi-Ning Chou Mrinal Kumar and Noam Solomon. 2018."},{"key":"e_1_3_2_2_23_1","unstructured":"Some Closure Results for Polynomial Factorization and Applications. ECCC Report TR18-052. In Electronic Colloquium on Computational Complexity (ECCC).  Some Closure Results for Polynomial Factorization and Applications. ECCC Report TR18-052. In Electronic Colloquium on Computational Complexity (ECCC)."},{"key":"e_1_3_2_2_24_1","unstructured":"Richard Courant Herbert Robbins and Ian Stewart. 1996.  Richard Courant Herbert Robbins and Ian Stewart. 1996."},{"volume-title":"an elementary approach to ideas and methods","author":"What","key":"e_1_3_2_2_25_1"},{"key":"e_1_3_2_2_26_1","unstructured":"Germund Dahlquist and \u00c5ke Bj\u00f6rck. 2008.  Germund Dahlquist and \u00c5ke Bj\u00f6rck. 2008."},{"key":"e_1_3_2_2_27_1","unstructured":"Numerical methods in scientific computing volume I. Society for Industrial and Applied Mathematics (2008).   Numerical methods in scientific computing volume I. Society for Industrial and Applied Mathematics (2008)."},{"volume-title":"Homomorphism Polynomials Complete for VP. In 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS. 493\u2013504","year":"2014","author":"Durand Arnaud","key":"e_1_3_2_2_28_1"},{"key":"e_1_3_2_2_29_1","unstructured":"\u00c9mile Durand. 1960. Solutions num\u00e9riques des \u00e9quations alg\u00e9briques. Tome I \u00c9quations du type F(x)= 0 racines d\u2019un polyn\u00f4me. (1960).  \u00c9mile Durand. 1960. Solutions num\u00e9riques des \u00e9quations alg\u00e9briques. Tome I \u00c9quations du type F(x)= 0 racines d\u2019un polyn\u00f4me. (1960)."},{"key":"e_1_3_2_2_30_1","unstructured":"Zeev Dvir Amir Shpilka and Amir Yehudayoff. 2009.  Zeev Dvir Amir Shpilka and Amir Yehudayoff. 2009."},{"volume-title":"1279\u20131293","year":"2009","author":"Comput SIAM J.","key":"e_1_3_2_2_31_1"},{"key":"e_1_3_2_2_32_1","unstructured":"(Preliminary version in STOC\u201908).  (Preliminary version in STOC\u201908)."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/363067.363115"},{"key":"e_1_3_2_2_34_1","unstructured":"Michael A Forbes and Amir Shpilka. 2015.  Michael A Forbes and Amir Shpilka. 2015."},{"volume-title":"Challenges in Polynomial Factorization. ACM SIGACT News 46, 4","year":"2015","author":"Complexity Theory","key":"e_1_3_2_2_35_1"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188792"},{"volume-title":"Proceedings of the 31st Conference on Computational Complexity. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, 32","year":"2016","author":"Forbes Michael A","key":"e_1_3_2_2_37_1"},{"key":"e_1_3_2_2_38_1","unstructured":"Patrizia Gianni Barry Trager and Gail Zacharias. 1988.  Patrizia Gianni Barry Trager and Gail Zacharias. 1988."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(88)80040-3"},{"volume-title":"On projected Newton barrier methods for linear programming and an equivalence to Karmarkar\u00e2\u0102\u0179s projective method. Mathematical programming 36, 2","year":"1986","author":"Gill Philip E","key":"e_1_3_2_2_40_1"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-015-0103-x"},{"key":"e_1_3_2_2_42_1","volume-title":"43rd International Colloquium on Automata, Languages, and Programming (ICALP","volume":"55","author":"Grochow Joshua A.","year":"2016"},{"volume-title":"Algebraic dependencies and PSPACE algorithms in approximative complexity. arXiv preprint arXiv:1801.09275","year":"2018","author":"Guo Zeyu","key":"e_1_3_2_2_43_1"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796393"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-2011-02505-6"},{"key":"e_1_3_2_2_46_1","unstructured":"Maurice J Jansen. 2011.  Maurice J Jansen. 2011."},{"key":"e_1_3_2_2_47_1","first-page":"n10","volume-title":"2nd Symposium on Innovations in Computer Science (ICS","author":"Arithmetic Extracting Roots","year":"2011"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780595"},{"key":"e_1_3_2_2_49_1","unstructured":"Erich Kaltofen. 1985.  Erich Kaltofen. 1985."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22160"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12163"},{"key":"e_1_3_2_2_52_1","unstructured":"Erich Kaltofen. 1987.  Erich Kaltofen. 1987."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28443"},{"key":"e_1_3_2_2_54_1","unstructured":"Erich Kaltofen. 1989.  Erich Kaltofen. 1989."},{"volume-title":"Randomness and Computation 5","year":"1989","author":"Factorization","key":"e_1_3_2_2_55_1"},{"key":"e_1_3_2_2_56_1","unstructured":"Erich Kaltofen. 1990.  Erich Kaltofen. 1990."},{"key":"e_1_3_2_2_57_1","unstructured":"Polynomial factorization 1982-1986.  Polynomial factorization 1982-1986."},{"volume-title":"of Comp. Sci. Report","year":"1990","key":"e_1_3_2_2_58_1"},{"key":"e_1_3_2_2_59_1","unstructured":"Erich Kaltofen. 1992.  Erich Kaltofen. 1992."},{"volume-title":"294\u2013313","year":"1992","author":"Polynomial","key":"e_1_3_2_2_60_1"},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390768.1390790"},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.18"},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133144"},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-007-0219-8"},{"key":"e_1_3_2_2_65_1","unstructured":"Gregor Kemper. 2010.  Gregor Kemper. 2010."},{"volume-title":"Springer Science &amp","author":"Commutative Algebra A","key":"e_1_3_2_2_66_1"},{"key":"e_1_3_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02162564"},{"key":"e_1_3_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-015-0102-y"},{"key":"e_1_3_2_2_69_1","unstructured":"Steven G Krantz and Harold R Parks. 2012.  Steven G Krantz and Harold R Parks. 2012."},{"volume-title":"history, theory, and applications","author":"The","key":"e_1_3_2_2_70_1"},{"volume-title":"Arithmetic Circuits with Locally Low Algebraic Rank. In 31st Conference on Computational Complexity, CCC 2016","year":"2016","author":"Kumar Mrinal","key":"e_1_3_2_2_71_1"},{"key":"e_1_3_2_2_72_1","unstructured":"Fran\u00e7ois Le Gall. 2014.  Fran\u00e7ois Le Gall. 2014."},{"key":"e_1_3_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"e_1_3_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/s102080010026"},{"key":"e_1_3_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100295"},{"key":"e_1_3_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90041-7"},{"volume-title":"Perspectives in Computational Complexity","author":"Mahajan Meena","key":"e_1_3_2_2_77_1"},{"key":"e_1_3_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.1090\/jams\/864"},{"key":"e_1_3_2_2_79_1","unstructured":"Ketan D. Mulmuley. 2012.  Ketan D. Mulmuley. 2012."},{"key":"e_1_3_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184341"},{"key":"e_1_3_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.15"},{"key":"e_1_3_2_2_82_1","unstructured":"Isaac Newton. 1669. De analysi per aequationes numero terminorum infinitas {On analysis by infinite series} (in Latin). (1669).  Isaac Newton. 1669. De analysi per aequationes numero terminorum infinitas {On analysis by infinite series} (in Latin). (1669)."},{"key":"e_1_3_2_2_83_1","unstructured":"(published in 1711 by William Jones).  (published in 1711 by William Jones)."},{"key":"e_1_3_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-016-0130-2"},{"key":"e_1_3_2_2_85_1","unstructured":"James M Ortega and Werner C Rheinboldt. 2000.  James M Ortega and Werner C Rheinboldt. 2000."},{"key":"e_1_3_2_2_86_1","unstructured":"Iterative solution of nonlinear equations in several variables. SIAM.  Iterative solution of nonlinear equations in several variables. SIAM."},{"volume-title":"41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016","year":"2016","author":"Pandey Anurag","key":"e_1_3_2_2_87_1"},{"key":"e_1_3_2_2_88_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2001.0493"},{"key":"e_1_3_2_2_89_1","unstructured":"David Alan Plaisted. 1977.  David Alan Plaisted. 1977."},{"volume-title":"18th Annual Symposium on. IEEE, 241\u2013253","author":"New","key":"e_1_3_2_2_90_1"},{"key":"e_1_3_2_2_91_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(77)80013-5"},{"key":"e_1_3_2_2_92_1","unstructured":"Ramprasad Saptharishi. 2016. A survey of lower bounds in arithmetic circuit complexity.  Ramprasad Saptharishi. 2016. A survey of lower bounds in arithmetic circuit complexity."},{"key":"e_1_3_2_2_93_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-08353-7_133"},{"key":"e_1_3_2_2_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"e_1_3_2_2_95_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000039"},{"key":"e_1_3_2_2_96_1","doi-asserted-by":"publisher","DOI":"10.5555\/2982445.2982476"},{"key":"e_1_3_2_2_97_1","unstructured":"Volker Strassen. 1973.  Volker Strassen. 1973."},{"volume-title":"Journal f\u00fcr die reine und angewandte Mathematik 264","year":"1973","author":"Vermeidung","key":"e_1_3_2_2_98_1"},{"key":"e_1_3_2_2_99_1","unstructured":"Madhu Sudan. 1997.  Madhu Sudan. 1997."},{"key":"e_1_3_2_2_100_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0439"},{"key":"e_1_3_2_2_101_1","unstructured":"Brook Taylor. 1715.  Brook Taylor. 1715."},{"key":"e_1_3_2_2_102_1","unstructured":"Methodus Incrementorum Directa et Inversa {Direct and Reverse Methods of Incrementation} (in Latin). (1715).  Methodus Incrementorum Directa et Inversa {Direct and Reverse Methods of Incrementation} (in Latin). (1715)."},{"key":"e_1_3_2_2_103_1","first-page":"332","volume-title":"A Source Book in Mathematics 1200\u00e2\u0102\u015e1800","author":"Struik Translated","year":"1969"},{"key":"e_1_3_2_2_104_1","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804419"},{"key":"e_1_3_2_2_105_1","first-page":"365","article-title":"Reducibility by algebraic projections. L\u2019Enseignement Mathematique: Logic and Algorithmic","volume":"2","author":"Valiant Leslie G.","year":"1982","journal-title":"Geneva"},{"key":"e_1_3_2_2_106_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212043"},{"key":"e_1_3_2_2_107_1","unstructured":"Joachim von zur Gathen and J\u00fcrgen Gerhard. 2013.  Joachim von zur Gathen and J\u00fcrgen Gerhard. 2013."},{"key":"e_1_3_2_2_108_1","unstructured":"Modern computer algebra. Cambridge university press.  Modern computer algebra. Cambridge university press."},{"key":"e_1_3_2_2_109_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90044-3"},{"key":"e_1_3_2_2_110_1","unstructured":"Oscar Zariski and Pierre Samuel. 1975.  Oscar Zariski and Pierre Samuel. 1975."},{"volume-title":"Reprint of the 1960 edition","author":"Commutative","key":"e_1_3_2_2_111_1"}],"event":{"name":"STOC '18: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Los Angeles CA USA","acronym":"STOC '18"},"container-title":["Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188760","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3188745.3188760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:08Z","timestamp":1750212428000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188760"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,20]]},"references-count":111,"alternative-id":["10.1145\/3188745.3188760","10.1145\/3188745"],"URL":"https:\/\/doi.org\/10.1145\/3188745.3188760","relation":{},"subject":[],"published":{"date-parts":[[2018,6,20]]},"assertion":[{"value":"2018-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}