{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:36Z","timestamp":1759638996812,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,7,29]],"date-time":"2007-07-29T00:00:00Z","timestamp":1185667200000},"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":[[2007,7,29]]},"DOI":"10.1145\/1277548.1277567","type":"proceedings-article","created":{"date-parts":[[2007,12,7]],"date-time":"2007-12-07T19:19:41Z","timestamp":1197055181000},"page":"127-134","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["On the complexity of real solving bivariate systems"],"prefix":"10.1145","author":[{"given":"Dimitrios I.","family":"Diochnos","sequence":"first","affiliation":[{"name":"National University of Athens"}]},{"given":"Ioannis Z.","family":"Emiris","sequence":"additional","affiliation":[{"name":"National University of Athens"}]},{"given":"Elias P.","family":"Tsigaridas","sequence":"additional","affiliation":[{"name":"LORIA-INRIA Lorraine"}]}],"member":"320","published-online":{"date-parts":[[2007,7,29]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"ISSAC","author":"Abbott J.","year":"2006","unstructured":"J. Abbott . Quadratic interval refinement for real roots . In ISSAC 2006 , poster. www.dima.unige.it\/~abbott\/. J. Abbott. Quadratic interval refinement for real roots. In ISSAC 2006, poster. www.dima.unige.it\/~abbott\/."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(88)80013-0"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-33099-2","volume-title":"Algorithms in Real Algebraic Geometry, Algorithms and Computation in Mathematics","author":"Basu S.","year":"2006","unstructured":"S. Basu , R. Pollack , and M -F. Roy . Algorithms in Real Algebraic Geometry, Algorithms and Computation in Mathematics . Springer-Verlag , 2 nd edition, 2006 . S. Basu, R. Pollack, and M -F. Roy. Algorithms in Real Algebraic Geometry, Algorithms and Computation in Mathematics. Springer-Verlag, 2nd edition, 2006.","edition":"2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62257"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2006.04.002"},{"key":"e_1_3_2_1_7_1","first-page":"81","volume-title":"Int. Workshop on Symbolic Numeric Computing","author":"Du Z.","year":"2005","unstructured":"Z. Du , V. Sharma , and C. K. Yap . Amortized bound for root isolation via Sturm sequences . Int. Workshop on Symbolic Numeric Computing , pp. 81 -- 93 , Beijing , 2005 . Z. Du, V. Sharma, and C. K. Yap. Amortized bound for root isolation via Sturm sequences. Int. Workshop on Symbolic Numeric Computing, pp. 81--93, Beijing, 2005."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277548.1277570"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1145768.1145786"},{"key":"e_1_3_2_1_10_1","volume-title":"LNCS (to appear)","author":"Emiris I. Z.","year":"2007","unstructured":"I. Z. Emiris , B. Mourrain , and E. P. Tsigaridas . Real Algebraic Numbers: Complexity Analysis and Experimentation. Reliable Implementations of Real Number Algorithms: Theory and Practice , LNCS (to appear) . Springer Verlag , 2007 . also available in www.inria.fr\/rrrt\/rr-5897.html. I. Z. Emiris, B. Mourrain, and E. P. Tsigaridas. Real Algebraic Numbers: Complexity Analysis and Experimentation. Reliable Implementations of Real Number Algorithms: Theory and Practice, LNCS (to appear). Springer Verlag, 2007. also available in www.inria.fr\/rrrt\/rr-5897.html."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11555964_13"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1996.0032"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/74540.74558"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8396(02)00167-X"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1995.1015"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1142\/S021865430500075X"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2000.0427"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1999.0322"},{"key":"e_1_3_2_1_19_1","volume-title":"Polynomials: An algorithmic approach","author":"Mignotte M.","year":"1999","unstructured":"M. Mignotte and D. Stefanescu . Polynomials: An algorithmic approach . Springer , 1999 . M. Mignotte and D. Stefanescu. Polynomials: An algorithmic approach. Springer, 1999."},{"key":"e_1_3_2_1_20_1","first-page":"89","volume-title":"Symbolic and Numerical Computation for Artificial Intelligence","author":"Milne P.","year":"1992","unstructured":"P. Milne . On the solution of a set of polynomial equations . In B. Donald, D. Kapur, and J. Mundy, editors, Symbolic and Numerical Computation for Artificial Intelligence , pp. 89 -- 102 . Academic Press , 1992 . P. Milne. On the solution of a set of polynomial equations. In B. Donald, D. Kapur, and J. Mundy, editors, Symbolic and Numerical Computation for Artificial Intelligence, pp. 89--102. Academic Press, 1992."},{"key":"e_1_3_2_1_21_1","volume-title":"INRIA Sophia-Antipolis","author":"Mourrain B.","year":"2005","unstructured":"B. Mourrain and J.-P. Pavone . Subdivision methods for solving polynomial equations. TR-5658 , INRIA Sophia-Antipolis , 2005 . B. Mourrain and J.-P. Pavone. Subdivision methods for solving polynomial equations. TR-5658, INRIA Sophia-Antipolis, 2005."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-33259-6_3"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/345542.345642"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2002.0531"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2752-6_15"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/258726.258792"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218024"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002000050114"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/93023.93072"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80019-3"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/780506.780520"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00639-4"},{"key":"e_1_3_2_1_33_1","volume-title":"MPI Informatik","author":"Wolpert N.","year":"2002","unstructured":"N. Wolpert . An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics. PhD thesis , MPI Informatik , 2002 . N. Wolpert. An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics. PhD thesis, MPI Informatik, 2002."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064092.1064111"},{"key":"e_1_3_2_1_35_1","volume-title":"Fundamental Problems of Algorithmic Algebra","author":"Yap C.","year":"2000","unstructured":"C. Yap . Fundamental Problems of Algorithmic Algebra . Oxford Univ. Press , New York , 2000 . C. Yap. Fundamental Problems of Algorithmic Algebra. Oxford Univ. Press, New York, 2000."}],"event":{"name":"ISSAC07: International Symposium on Symbolic and Algebraic Computation","sponsor":["ACM Association for Computing Machinery","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Waterloo Ontario Canada","acronym":"ISSAC07"},"container-title":["Proceedings of the 2007 international symposium on Symbolic and algebraic computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1277548.1277567","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1277548.1277567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:58:13Z","timestamp":1750258693000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1277548.1277567"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,29]]},"references-count":34,"alternative-id":["10.1145\/1277548.1277567","10.1145\/1277548"],"URL":"https:\/\/doi.org\/10.1145\/1277548.1277567","relation":{},"subject":[],"published":{"date-parts":[[2007,7,29]]},"assertion":[{"value":"2007-07-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}