{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:53:01Z","timestamp":1750308781461,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,8,3]],"date-time":"2009-08-03T00:00:00Z","timestamp":1249257600000},"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":[[2009,8,3]]},"DOI":"10.1145\/1577190.1577200","type":"proceedings-article","created":{"date-parts":[[2009,9,25]],"date-time":"2009-09-25T19:37:20Z","timestamp":1253907440000},"page":"29-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing nearest Gcd with certification"],"prefix":"10.1145","author":[{"given":"Guillaume","family":"Ch\u00e8ze","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paul Sabatier, Toulouse, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Claude","family":"Yakoubsohn","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paul Sabatier, Toulouse, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Galligo","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Nice Sophia-Antipolis, Nice, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Mourrain","sequence":"additional","affiliation":[{"name":"INRIA M\u00e9diterran\u00e9e, Sophia Antipolis, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,8,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(88)80013-0"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1998.0234"},{"key":"e_1_3_2_1_3_1","volume-title":"Vol 1 : Fundamental Algorithms. Birkhäuser","author":"Bini D.","year":"1994","unstructured":"D. Bini and V. Y. Pan . Polynomial and matrix computations , Vol 1 : Fundamental Algorithms. Birkhäuser , Boston , 1994 . D. Bini and V. Y. Pan. Polynomial and matrix computations, Vol 1 : Fundamental Algorithms. Birkhäuser, Boston, 1994."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277548.1277551"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218127496001818"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/321662.321664"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/220346.220371"},{"key":"e_1_3_2_1_8_1","series-title":"Lectures in Appl","first-page":"285","volume-title":"The mathematics of numerical analysis (Park City","author":"Dedieu J. P.","year":"1995","unstructured":"J. P. Dedieu , X. Gourdon , and J. C. Yakoubsohn . Computing the distance from a point to an algebraic hypersurface . In The mathematics of numerical analysis (Park City , UT, 1995 ), volume 32 of Lectures in Appl . Math., pages 285 -- 293 . Amer. Math. Soc., Providence, RI , 1996. J. P. Dedieu, X. Gourdon, and J. C. Yakoubsohn. Computing the distance from a point to an algebraic hypersurface. In The mathematics of numerical analysis (Park City, UT, 1995), volume 32 of Lectures in Appl. Math., pages 285--293. Amer. Math. Soc., Providence, RI, 1996."},{"key":"e_1_3_2_1_9_1","unstructured":"I. Z.\n      Emiris A.\n      Galligo and \n      H.\n      Lombardi\n  . \n  Numerical Univariate Polynomial GCD volume \n  32\n   of \n  Lectures in Applied Math\n  . pages \n  323\n  --\n  343\n  . \n  AMS 1996\n  .  I. Z. Emiris A. Galligo and H. Lombardi. Numerical Univariate Polynomial GCD volume 32 of Lectures in Applied Math. pages 323--343. AMS 1996."},{"key":"e_1_3_2_1_10_1","volume-title":"Certified approximate univariate GCDs. J. Pure &amp","author":"Emiris I. Z.","year":"1997","unstructured":"I. Z. Emiris , A. Galligo , and H. Lombardi . Certified approximate univariate GCDs. J. Pure &amp ; Applied Algebra, Special Issue on Algorithms for Algebra , 117 & 118:229--251, May 1997 . I. Z. Emiris, A. Galligo, and H. Lombardi. Certified approximate univariate GCDs. J. Pure & Applied Algebra, Special Issue on Algorithms for Algebra, 117 & 118:229--251, May 1997."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-004-0144-z"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1997.0160"},{"key":"e_1_3_2_1_13_1","first-page":"69","volume-title":"Trends Math.","author":"Kaltofen Erich","year":"2007","unstructured":"Erich Kaltofen , Zhengfeng Yang , and Lihong Zhi . Structured low rank approximation of a Sylvester matrix. In Symbolic-numeric computation , Trends Math. , pages 69 -- 83 . Birkhäuser, Basel , 2007 . Erich Kaltofen, Zhengfeng Yang, and Lihong Zhi. Structured low rank approximation of a Sylvester matrix. In Symbolic-numeric computation, Trends Math., pages 69--83. Birkhäuser, Basel, 2007."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1998.0232"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/174462.174617"},{"key":"e_1_3_2_1_16_1","series-title":"SIAM Studies in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-point polynomial algorithms in convex programming","author":"Nesterov Yurii","year":"1994","unstructured":"Yurii Nesterov and Arkadii Nemirovskii . Interior-point polynomial algorithms in convex programming , volume 13 of SIAM Studies in Applied Mathematics . Society for Industrial and Applied Mathematics (SIAM) , Philadelphia, PA , 1994 . Yurii Nesterov and Arkadii Nemirovskii. Interior-point polynomial algorithms in convex programming, volume 13 of SIAM Studies in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1994."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-006-9119-8"},{"key":"e_1_3_2_1_18_1","first-page":"335","volume-title":"Proceedings of the International Symposium on Computational Mathematics (Matsuyama, 1990","volume":"38","author":"Noda Matu-Tarow","year":"1991","unstructured":"Matu-Tarow Noda and Tateaki Sasaki . Approximate GCD and its application to ill-conditioned algebraic equations . In Proceedings of the International Symposium on Computational Mathematics (Matsuyama, 1990 ), volume 38 , pages 335 -- 351 , 1991 . Matu-Tarow Noda and Tateaki Sasaki. Approximate GCD and its application to ill-conditioned algebraic equations. In Proceedings of the International Symposium on Computational Mathematics (Matsuyama, 1990), volume 38, pages 335--351, 1991."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.3032"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0885-064X(85)90024-X"},{"issue":"2","key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","first-page":"459","DOI":"10.2307\/2152805","article-title":"Geometric aspects","volume":"6","author":"Shub Michael","year":"1993","unstructured":"Michael Shub and Steve Smale . Complexity of Bézout's theorem. I. Geometric aspects . J. Amer. Math. Soc. , 6 ( 2 ): 459 -- 501 , 1993 . Michael Shub and Steve Smale. Complexity of Bézout's theorem. I. Geometric aspects. J. Amer. Math. Soc., 6(2):459--501, 1993.","journal-title":"J. Amer. Math. Soc."},{"key":"e_1_3_2_1_23_1","volume-title":"The approximate GCD of inexact polynomials. I. A a univariate algorithm","author":"Zeng Zhonggang","year":"2004","unstructured":"Zhonggang Zeng and Barry H. Dayton . The approximate GCD of inexact polynomials. I. A a univariate algorithm . 2004 . Zhonggang Zeng and Barry H. Dayton. The approximate GCD of inexact polynomials. I. A a univariate algorithm. 2004."}],"event":{"name":"SNC '09: Symbolic Numeric Computation","sponsor":["ACM Association for Computing Machinery","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Kyoto Japan","acronym":"SNC '09"},"container-title":["Proceedings of the 2009 conference on Symbolic numeric computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1577190.1577200","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1577190.1577200","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:43Z","timestamp":1750278163000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1577190.1577200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,3]]},"references-count":22,"alternative-id":["10.1145\/1577190.1577200","10.1145\/1577190"],"URL":"https:\/\/doi.org\/10.1145\/1577190.1577200","relation":{},"subject":[],"published":{"date-parts":[[2009,8,3]]},"assertion":[{"value":"2009-08-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}