{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:04Z","timestamp":1750306084126,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,23]],"date-time":"2017-07-23T00:00:00Z","timestamp":1500768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,23]]},"DOI":"10.1145\/3087604.3087631","type":"proceedings-article","created":{"date-parts":[[2017,7,19]],"date-time":"2017-07-19T20:02:15Z","timestamp":1500494535000},"page":"381-388","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Bounds on Absolute Positiveness of Multivariate Polynomials"],"prefix":"10.1145","author":[{"given":"Swaroop N.","family":"Prabhakar","sequence":"first","affiliation":[{"name":"Institute of Mathematical Sciences, HBNI, Chennai, India"}]},{"given":"Vikram","family":"Sharma","sequence":"additional","affiliation":[{"name":"Institute of Mathematical Sciences, HBNI, Chennai, India"}]}],"member":"320","published-online":{"date-parts":[[2017,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-006-0186-y"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32859-1_50"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2016.10.001"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2010.01.012"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1370949"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.757575"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2014.09.038"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1614191"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1997.0189"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1005983105493"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(86)90096-8"},{"key":"e_1_3_2_1_12_1","volume-title":"A note about \"Faster algorithms for computing Hong's bound on absolute positiveness\" by K. Mehlhorn and S. Ray. CoRR abs\/1611.06548","author":"Koprowski Przemyslaw","year":"2016","unstructured":"Przemyslaw Koprowski. 2016. A note about \"Faster algorithms for computing Hong's bound on absolute positiveness\" by K. Mehlhorn and S. Ray. CoRR abs\/1611.06548 (2016)."},{"key":"e_1_3_2_1_13_1","volume-title":"Euvres de Lagrange","author":"Lagrange Joseph-Louis","unstructured":"Joseph-Louis Lagrange. 1879. Trait\u00e9 de la r\u00e9solution des\u00e9quations num\u00e9riques de tous les degr\u00e9s, Euvres de Lagrange (4th ed.). Vol. 8. Gauthier-Villars, Paris.","edition":"4"},{"volume-title":"Accelerated Newton Iteration for Roots of Black Box Polynomials. In 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). 732--740","author":"Louis A.","key":"e_1_3_2_1_14_1","unstructured":"A. Louis and S. S. Vempala. 2016. Accelerated Newton Iteration for Roots of Black Box Polynomials. In 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). 732--740."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2010.02.002"},{"volume-title":"On an Estimation of Polynomial Roots by Lagrange. IRMA","author":"Mignotte M.","key":"e_1_3_2_1_16_1","unstructured":"M. Mignotte and D. \u0160tef\u0103nescu. 2002. On an Estimation of Polynomial Roots by Lagrange. IRMA, Univ. de Louis Pasteur et C.N.R.S."},{"key":"e_1_3_2_1_17_1","volume-title":"CASC","author":"Swaroop","year":"2016","unstructured":"Swaroop N. Prabhakar and Vikram Sharma. 2016. A Lower Bound for Computing Lagrange's Real Root Bound. In Computer Algebra in Scientific Computing, CASC 2016. 444--456."},{"key":"e_1_3_2_1_18_1","first-page":"2132","article-title":"New bounds for the positive roots of poly- nomials","volume":"11","author":"\u0160tef\u0103nescu D.","year":"2005","unstructured":"D. \u0160tef\u0103nescu. 2005. New bounds for the positive roots of poly- nomials. Journal of Universal Computer Science 11, 12 (2005), 2132--2141.","journal-title":"Journal of Universal Computer Science"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24021-3_33"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1933.11987388"}],"event":{"name":"ISSAC '17: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Kaiserslautern Germany","acronym":"ISSAC '17"},"container-title":["Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087604.3087631","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087604.3087631","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:14Z","timestamp":1750217414000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087604.3087631"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,23]]},"references-count":20,"alternative-id":["10.1145\/3087604.3087631","10.1145\/3087604"],"URL":"https:\/\/doi.org\/10.1145\/3087604.3087631","relation":{},"subject":[],"published":{"date-parts":[[2017,7,23]]},"assertion":[{"value":"2017-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}