{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:22:23Z","timestamp":1762323743085,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,23]],"date-time":"2014-07-23T00:00:00Z","timestamp":1406073600000},"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":[[2014,7,23]]},"DOI":"10.1145\/2608628.2608668","type":"proceedings-article","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T14:23:03Z","timestamp":1404224583000},"page":"75-82","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Improved algorithm for computing separating linear forms for bivariate systems"],"prefix":"10.1145","author":[{"given":"Yacine","family":"Bouzidi","sequence":"first","affiliation":[{"name":"INRIA Nancy Grand Est, LORIA, Nancy, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Lazard","sequence":"additional","affiliation":[{"name":"INRIA Nancy Grand Est, LORIA, Nancy, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Moroz","sequence":"additional","affiliation":[{"name":"INRIA Nancy Grand Est, LORIA, Nancy, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Pouget","sequence":"additional","affiliation":[{"name":"INRIA Nancy Grand Est, LORIA, Nancy, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrice","family":"Rouillier","sequence":"additional","affiliation":[{"name":"INRIA Paris-Rocquencourt, IMJ, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/246346.246355"},{"key":"e_1_3_2_1_2_1","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-33099-2","volume-title":"Algorithms in Real Algebraic Geometry","author":"Basu S.","year":"2006","unstructured":"S. Basu , R. Pollack , and M.-F. Roy . Algorithms in Real Algebraic Geometry , volume 10 of Algorithms and Computation in Mathematics . Springer-Verlag , 2 nd edition, 2006 . S. Basu, R. Pollack, and M.-F. Roy. Algorithms in Real Algebraic Geometry, volume 10 of Algorithms and Computation in Mathematics. Springer-Verlag, 2nd edition, 2006.","edition":"2"},{"issue":"4","key":"e_1_3_2_1_3_1","first-page":"239","article-title":"Fast algorithms for zero-dimensional polynomial systems using duality. Applicable Algebra in Engineering","volume":"14","author":"Bostan A.","year":"2003","unstructured":"A. Bostan , B. Salvy , and \u00c9. Schost . Fast algorithms for zero-dimensional polynomial systems using duality. Applicable Algebra in Engineering , Communication and Computing , 14 ( 4 ): 239 -- 272 , 2003 . A. Bostan, B. Salvy, and \u00c9. Schost. Fast algorithms for zero-dimensional polynomial systems using duality. Applicable Algebra in Engineering, Communication and Computing, 14(4):239--272, 2003.","journal-title":"Communication and Computing"},{"key":"e_1_3_2_1_5_1","volume-title":"Symb. Comput.","author":"Bouzidi Y.","year":"2014","unstructured":"Y. Bouzidi , S. Lazard , M. Pouget , and F. Rouillier . Separating linear forms and rational univariate representations of bivariate systems. J . Symb. Comput. , 2014 . To appear. Y. Bouzidi, S. Lazard, M. Pouget, and F. Rouillier. Separating linear forms and rational univariate representations of bivariate systems. J. Symb. Comput., 2014. To appear."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2008.04.009"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(02)00135-9"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.2000.0571"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1996.0032"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2010.08.016"},{"key":"e_1_3_2_1_11_1","volume-title":"From approximate factorization to root isolation with application to cylindrical algebraic decomposition. CoRR, abs\/1301.4870","author":"Mehlhorn K.","year":"2013","unstructured":"K. Mehlhorn , M. Sagraloff , and P. Wang . From approximate factorization to root isolation with application to cylindrical algebraic decomposition. CoRR, abs\/1301.4870 , 2013 . K. Mehlhorn, M. Sagraloff, and P. Wang. From approximate factorization to root isolation with application to cylindrical algebraic decomposition. CoRR, abs\/1301.4870, 2013."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80029-2"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/258726.258792"},{"issue":"5","key":"e_1_3_2_1_14_1","first-page":"433","article-title":"Solving zero-dimensional systems through the rational univariate representation. J. of Applicable Algebra in Engineering","volume":"9","author":"Rouillier F.","year":"1999","unstructured":"F. Rouillier . Solving zero-dimensional systems through the rational univariate representation. J. of Applicable Algebra in Engineering , Communication and Computing , 9 ( 5 ): 433 -- 461 , 1999 . F. Rouillier. Solving zero-dimensional systems through the rational univariate representation. J. of Applicable Algebra in Engineering, Communication and Computing, 9(5):433--461, 1999.","journal-title":"Communication and Computing"},{"key":"e_1_3_2_1_15_1","volume-title":"Modern Computer Algebra","author":"von zur Gathen J.","year":"2003","unstructured":"J. von zur Gathen and J. Gerhard . Modern Computer Algebra . Cambridge Univ. Press , Cambridge, U.K. , 2 nd edition, 2003 . J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge Univ. Press, Cambridge, U.K., 2nd edition, 2003.","edition":"2"}],"event":{"name":"ISSAC '14: International Symposium on Symbolic and Algebraic Computation","sponsor":["ACM Association for Computing Machinery","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Kobe Japan","acronym":"ISSAC '14"},"container-title":["Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2608628.2608668","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2608628.2608668","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:55:59Z","timestamp":1750272959000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2608628.2608668"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,23]]},"references-count":14,"alternative-id":["10.1145\/2608628.2608668","10.1145\/2608628"],"URL":"https:\/\/doi.org\/10.1145\/2608628.2608668","relation":{},"subject":[],"published":{"date-parts":[[2014,7,23]]},"assertion":[{"value":"2014-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}