{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:30:11Z","timestamp":1750307411077,"version":"3.41.0"},"reference-count":9,"publisher":"Association for Computing Machinery (ACM)","issue":"3\/4","license":[{"start":{"date-parts":[[2010,6,24]],"date-time":"2010-06-24T00:00:00Z","timestamp":1277337600000},"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":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2010,6,24]]},"DOI":"10.1145\/1823931.1823939","type":"journal-article","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T13:02:22Z","timestamp":1277816542000},"page":"81-83","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["On least fixed points of systems of positive polynomials"],"prefix":"10.1145","volume":"43","author":[{"given":"Javier","family":"Esparza","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Gaiser","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Kiefer","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,24]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-65371-1","volume-title":"Branching Processes","author":"Athreya Krishna B.","year":"1972","unstructured":"Krishna B. Athreya and Peter E. Ney . Branching Processes . Springer-Verlag , 1972 . Krishna B. Athreya and Peter E. Ney. Branching Processes. Springer-Verlag, 1972."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1997.0161"},{"key":"e_1_2_1_3_1","first-page":"289","volume-title":"Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science","author":"Esparza Javier","year":"2008","unstructured":"Javier Esparza , Stefan Kiefer , and Michael Luttenberger . Convergence thresholds of Newton's method for monotone polynomial equations . In Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science , pages 289 -- 300 , 2008 . Javier Esparza, Stefan Kiefer, and Michael Luttenberger. Convergence thresholds of Newton's method for monotone polynomial equations. In Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, pages 289--300, 2008."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018438.1021838"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1462153.1462154"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-51866-9"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250822"},{"key":"e_1_2_1_8_1","volume-title":"Manning and Hinrich Schuetze. Foundations of Statistical Natural Language Processing","author":"Christopher","year":"1999","unstructured":"Christopher D. Manning and Hinrich Schuetze. Foundations of Statistical Natural Language Processing . The MIT Press , June 1999 . Christopher D. Manning and Hinrich Schuetze. Foundations of Statistical Natural Language Processing. The MIT Press, June 1999."},{"key":"e_1_2_1_9_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/978-3-540-71209-1_7","volume-title":"TACAS","author":"Wojtczak Dominik","year":"2007","unstructured":"Dominik Wojtczak and Kousha Etessami . Premo : An analyzer for probabilistic recursive models . In TACAS , volume 4424 of Lecture Notes in Computer Science , pages 66 -- 71 . Springer , 2007 . Dominik Wojtczak and Kousha Etessami. Premo : An analyzer for probabilistic recursive models. In TACAS, volume 4424 of Lecture Notes in Computer Science, pages 66--71. Springer, 2007."}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1823931.1823939","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1823931.1823939","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:33Z","timestamp":1750246773000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1823931.1823939"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,24]]},"references-count":9,"journal-issue":{"issue":"3\/4","published-print":{"date-parts":[[2010,6,24]]}},"alternative-id":["10.1145\/1823931.1823939"],"URL":"https:\/\/doi.org\/10.1145\/1823931.1823939","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2010,6,24]]},"assertion":[{"value":"2010-06-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}