乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:20:07Z","timestamp":1725790807073},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,7,9]]},"DOI":"10.1145\/1145768.1145786","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T12:53:01Z","timestamp":1153745581000},"page":"71-78","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":38,"title":["Almost tight recursion tree bounds for the Descartes method"],"prefix":"10.1145","author":[{"given":"Arno","family":"Eigenwillig","sequence":"first","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}]},{"given":"Vikram","family":"Sharma","sequence":"additional","affiliation":[{"name":"NYU, New York"}]},{"given":"Chee K.","family":"Yap","sequence":"additional","affiliation":[{"name":"NYU, New York"}]}],"member":"320","published-online":{"date-parts":[[2006,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1197095"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/800205.806346"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/74540.74574"},{"key":"e_1_3_2_1_6_1","first-page":"81","volume-title":"Proc. Internat. Workshop on Symbolic-Numeric Computation","author":"Du Z.","year":"2005","unstructured":"Z. Du , V. Sharma , and C. K. Yap . Amortized bound for root isolation via Sturm sequences. In D. Wang and L. Zhi, editors , Proc. Internat. Workshop on Symbolic-Numeric Computation , pages 81 -- 93 , 2005 . Int'l Workshop on Symbolic Numeric Computation, Xi'an, China, Jul 19--21 , 2005. Z. Du, V. Sharma, and C. K. Yap. Amortized bound for root isolation via Sturm sequences. In D. Wang and L. Zhi, editors, Proc. Internat. Workshop on Symbolic-Numeric Computation, pages 81--93, 2005. Int'l Workshop on Symbolic Numeric Computation, Xi'an, China, Jul 19--21, 2005."},{"volume-title":"Observatiunculae ad theoriam aequationum pertinentes. Journal f\u00fcr die reine und angewandte Mathematik, 13:340--352","year":"1835","author":"Jacobi C. G. J.","key":"e_1_3_2_1_8_1","unstructured":"C. G. J. Jacobi . Observatiunculae ad theoriam aequationum pertinentes. Journal f\u00fcr die reine und angewandte Mathematik, 13:340--352 , 1835 . Available from http:\/\/gdz.sub.uni-goettingen.de. C. G. J. Jacobi. Observatiunculae ad theoriam aequationum pertinentes. Journal f\u00fcr die reine und angewandte Mathematik, 13:340--352, 1835. Available from http:\/\/gdz.sub.uni-goettingen.de."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-9459-1_13"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073884.1073913"},{"key":"e_1_3_2_1_11_1","first-page":"105","volume-title":"Wissenschaftliches Rechnen","author":"Krandick W.","year":"1995","unstructured":"W. Krandick . Isolierung reeller Nullstellen von Polynomen . In J. Herzberger, editor, Wissenschaftliches Rechnen , pages 105 -- 154 . Akademie-Verlag , Berlin , 1995 . W. Krandick. Isolierung reeller Nullstellen von Polynomen. In J. Herzberger, editor, Wissenschaftliches Rechnen, pages 105--154. Akademie-Verlag, Berlin, 1995."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2005.02.004"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934076"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2000.0427"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1307\/mmj\/1028999140"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/800206.806395"},{"volume-title":"Commun., and Comput., 6:327--332","year":"1995","author":"Mignotte M.","key":"e_1_3_2_1_17_1","unstructured":"M. Mignotte . On the distance between the roots of a polynomial. Applicable Algebra in Engineering , Commun., and Comput., 6:327--332 , 1995 . M. Mignotte. On the distance between the roots of a polynomial. Applicable Algebra in Engineering, Commun., and Comput., 6:327--332, 1995."},{"volume-title":"\u015etef\u01cenescu. Polynomials: An Algorithmic Approach","year":"1999","author":"Mignotte M.","key":"e_1_3_2_1_18_1","unstructured":"M. Mignotte and D. \u015etef\u01cenescu. Polynomials: An Algorithmic Approach . Springer , Singapore , 1999 . M. Mignotte and D. \u015etef\u01cenescu. Polynomials: An Algorithmic Approach. Springer, Singapore, 1999."},{"key":"e_1_3_2_1_19_1","first-page":"459","volume-title":"Combinatorial and Computational Geometry, number 52 in MSRI","author":"Mourrain B.","year":"2005","unstructured":"B. Mourrain , F. Rouillier , and M.-F. Roy . The Bernstein basis and real root isolation . In J. E. Goodman, J. Pach, and E. Welzl, editors, Combinatorial and Computational Geometry, number 52 in MSRI Publications, pages 459 -- 478 . Cambridge University Press , 2005 . B. Mourrain, F. Rouillier, and M.-F. Roy. The Bernstein basis and real root isolation. In J. E. Goodman, J. Pach, and E. Welzl, editors, Combinatorial and Computational Geometry, number 52 in MSRI Publications, pages 459--478. Cambridge University Press, 2005."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.2001.0636"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-9355-8_53"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/581820"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/258726.258792"},{"volume-title":"INRIA","year":"2001","author":"Rouillier F.","key":"e_1_3_2_1_24_1","unstructured":"F. Rouillier and P. Zimmermann . Efficient isolation of a polynomial{'s} real roots. Rapport de Recherche 4113 , INRIA , 2001 . http:\/\/www.inria.fr\/rrrt\/rr-4113.html. F. Rouillier and P. Zimmermann. Efficient isolation of a polynomial{'s} real roots. Rapport de Recherche 4113, INRIA, 2001. http:\/\/www.inria.fr\/rrrt\/rr-4113.html."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2003.08.015"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/258726.258745"},{"volume-title":"Fundamental Problems of Algorithmic Algebra","year":"2000","author":"Yap C. K.","key":"e_1_3_2_1_27_1","unstructured":"C. K. Yap . Fundamental Problems of Algorithmic Algebra . Oxford University Press , 2000 . C. K. Yap. Fundamental Problems of Algorithmic Algebra. Oxford University Press, 2000."}],"event":{"name":"ISSAC06: International Symposium on Symbolic and Algebraic Computation","sponsor":["ACM Association for Computing Machinery","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Genoa Italy","acronym":"ISSAC06"},"container-title":["Proceedings of the 2006 international symposium on Symbolic and algebraic computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1145768.1145786","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T17:01:37Z","timestamp":1673370097000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1145768.1145786"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,9]]},"references-count":24,"alternative-id":["10.1145\/1145768.1145786","10.1145\/1145768"],"URL":"https:\/\/doi.org\/10.1145\/1145768.1145786","relation":{},"subject":[],"published":{"date-parts":[[2006,7,9]]},"assertion":[{"value":"2006-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}