{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:24:12Z","timestamp":1787315052989,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540705741","type":"print"},{"value":"9783540705758","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70575-8_57","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"698-710","source":"Crossref","is-referenced-by-count":15,"title":["Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations"],"prefix":"10.1007","author":[{"given":"Javier","family":"Esparza","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Gawlitza","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Kiefer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"57_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0890-5401(92)90048-K","volume":"96","author":"A. Condon","year":"1992","unstructured":"Condon, A.: The complexity of stochastic games. Inf. and Comp.\u00a096(2), 203\u2013224 (1992)","journal-title":"Inf. and Comp."},{"key":"57_CR2","doi-asserted-by":"crossref","unstructured":"Esparza, J., Gawlitza, T., Kiefer, S., Seidl, H.: Approximative methods for monotone systems of min-max-polynomial equations. Technical report, Technische Universit\u00e4t M\u00fcnchen, Institut f\u00fcr Informatik (February 2008)","DOI":"10.1007\/978-3-540-70575-8_57"},{"key":"57_CR3","doi-asserted-by":"crossref","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: Convergence thresholds of Newton\u2019s method for monotone polynomial equations. In: Proceedings of STACS, pp. 289\u2013300 (2008)","DOI":"10.1145\/1250790.1250822"},{"key":"57_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-540-31856-9_28","volume-title":"STACS 2005","author":"K. Etessami","year":"2005","unstructured":"Etessami, K., Yannakakis, M.: Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 340\u2013352. Springer, Heidelberg (2005)"},{"key":"57_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/b138445","volume-title":"Automata, Languages and Programming","author":"K. Etessami","year":"2005","unstructured":"Etessami, K., Yannakakis, M.: Recursive Markov decision processes and recursive stochastic games. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580. Springer, Heidelberg (2005)"},{"key":"57_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/11672142_52","volume-title":"STACS 2006","author":"K. Etessami","year":"2006","unstructured":"Etessami, K., Yannakakis, M.: Efficient qualitative analysis of classes of recursive Markov decision processes and simple stochastic games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 634\u2013645. Springer, Heidelberg (2006)"},{"key":"57_CR7","volume-title":"Competitive Markov Decision processes","author":"J. Filar","year":"1997","unstructured":"Filar, J., Vrieze, K.: Competitive Markov Decision processes. Springer, Heidelberg (1997)"},{"key":"57_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-540-71316-6_21","volume-title":"Programming Languages and Systems","author":"T. Gawlitza","year":"2007","unstructured":"Gawlitza, T., Seidl, H.: Precise fixpoint computation through strategy iteration. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, pp. 300\u2013315. Springer, Heidelberg (2007)"},{"key":"57_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-74915-8_6","volume-title":"Computer Science Logic","author":"T. Gawlitza","year":"2007","unstructured":"Gawlitza, T., Seidl, H.: Precise relational invariants through strategy iteration. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 23\u201340. Springer, Heidelberg (2007)"},{"key":"57_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-51866-9","volume-title":"The Theory of Branching Processes","author":"T.E. Harris","year":"1963","unstructured":"Harris, T.E.: The Theory of Branching Processes. Springer, Heidelberg (1963)"},{"key":"57_CR11","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/1250790.1250822","volume-title":"STOC","author":"S. Kiefer","year":"2007","unstructured":"Kiefer, S., Luttenberger, M., Esparza, J.: On the convergence of Newton\u2019s method for monotone systems of polynomial equations. In: STOC, pp. 217\u2013226. ACM, New York (2007)"},{"key":"57_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-010-0189-2","volume-title":"Stochastic Games and Applications","author":"A. Neyman","year":"2003","unstructured":"Neyman, A., Sorin, S.: Stochastic Games and Applications. Kluwer Academic Press, Dordrecht (2003)"},{"key":"57_CR13","volume-title":"Iterative solution of nonlinear equations in several variables","author":"J. Ortega","year":"1970","unstructured":"Ortega, J., Rheinboldt, W.: Iterative solution of nonlinear equations in several variables. Academic Press, London (1970)"},{"key":"57_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-540-71209-1_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D. Wojtczak","year":"2007","unstructured":"Wojtczak, D., Etessami, K.: PReMo: An analyzer for probabilistic recursive models. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 66\u201371. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70575-8_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T23:30:40Z","timestamp":1714606240000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-70575-8_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705741","9783540705758"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70575-8_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}