{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:01:18Z","timestamp":1760061678250,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T00:00:00Z","timestamp":1562544000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Research Grants Council of the Hong Kong SAR","award":["GRF grant (project number CityU 11202017)"],"award-info":[{"award-number":["GRF grant (project number CityU 11202017)"]}]},{"name":"Einstein Foundation Berlin"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,8]]},"DOI":"10.1145\/3326229.3326252","type":"proceedings-article","created":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T12:53:20Z","timestamp":1562676800000},"page":"114-121","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Plantinga-Vegter Algorithm takes Average Polynomial Time"],"prefix":"10.1145","author":[{"given":"Felipe","family":"Cucker","sequence":"first","affiliation":[{"name":"City University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alperen A.","family":"Erg\u00fcr","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josue","family":"Tonelli-Cueto","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,7,8]]},"reference":[{"volume-title":"Grundlehren der mathematischen Wissenschaften","author":"B\u00fcrgisser Peter","key":"e_1_3_2_1_1_1","unstructured":"Peter B\u00fcrgisser and Felipe Cucker. 2013. Condition. Grundlehren der mathematischen Wissenschaften, Vol. 349. Springer-Verlag, Berlin."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3275242"},{"key":"e_1_3_2_1_3_1","volume-title":"Computing the Homology of Semialgebraic Sets. I: Lax Formulas. (2018). arxiv","author":"Peter B\u00fc","year":"1807","unstructured":"Peter B\u00fc rgisser, Felipe Cucker, and Josu\u00e9 Tonelli-Cueto. 2018. Computing the Homology of Semialgebraic Sets. I: Lax Formulas. (2018). arxiv: 1807.06435 To appear at JFoCM."},{"key":"e_1_3_2_1_4_1","volume-title":"Continuous amortization: A non-probabilistic adaptive analysis technique. Electronic Colloquium on Computational Complexity Report. No. 136","author":"Burr Michael","year":"2009","unstructured":"Michael Burr, Felix Krahmer, and Chee Yap. 2009. Continuous amortization: A non-probabilistic adaptive analysis technique. Electronic Colloquium on Computational Complexity Report. No. 136 (2009)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2016.01.007"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087604.3087654"},{"key":"e_1_3_2_1_7_1","volume-title":"Tsigaridas","author":"Burr Michael A.","year":"2018","unstructured":"Michael A. Burr, Shuhong Gao, and Elias P. Tsigaridas. 2018. The Complexity of Subdivision for Diameter-Distance Tests. (2018). arxiv: 1801.05864"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2008.03.001"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11784-009-0127-4"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2011.07.001"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/3269376.3269425"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1988-0929546-7"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Alperen A. Erg\u00fcr Grigoris Paouris and J. Maurice Rojas. 2018a. Probabilistic Condition Number Estimates for Real Polynomial Systems I: A Broader Family of Distributions. Found. Comput. Math. (2018).","DOI":"10.1007\/s10208-018-9380-5"},{"key":"e_1_3_2_1_14_1","volume-title":"Probabilistic Condition Number Estimates for Real Polynomial Systems II: Structure and Smoothed Analysis . (2018). arxiv","author":"Erg\u00fcr Alperen A.","year":"1809","unstructured":"Alperen A. Erg\u00fcr, Grigoris Paouris, and J. Maurice Rojas. 2018b. Probabilistic Condition Number Estimates for Real Polynomial Systems II: Structure and Smoothed Analysis . (2018). arxiv: 1809.03626"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-016-1431-5"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1057432.1057465"},{"volume-title":"Computer methods for the range of functions","author":"Ratschek Helmut","key":"e_1_3_2_1_17_1","unstructured":"Helmut Ratschek and Jon Rokne. 1984. Computer methods for the range of functions .Ellis Horwood Ltd., Chichester; Halsted Press {John Wiley & Sons, Inc.}, New York. 168 pages."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0805026"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2008.01.010"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1093\/imrn\/rnu243"},{"volume-title":"Smoothed Analysis of Algorithms. In Proceedings of the International Congress of Mathematicians","author":"Daniel","key":"e_1_3_2_1_21_1","unstructured":"Daniel A. Spielman and Shang-Hua Teng. 2002. Smoothed Analysis of Algorithms. In Proceedings of the International Congress of Mathematicians, Vol. I. 597--606."},{"key":"e_1_3_2_1_22_1","series-title":"Cambridge Series in Statistical and Probabilistic Mathematics","volume-title":"High-dimensional probability: An introduction with applications in data science","author":"Vershynin Roman","unstructured":"Roman Vershynin. 2018. High-dimensional probability: An introduction with applications in data science. Cambridge Series in Statistical and Probabilistic Mathematics, Vol. 47. Cambridge University Press, Cambridge."}],"event":{"name":"ISSAC '19: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Beijing China","acronym":"ISSAC '19"},"container-title":["Proceedings of the 2019 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3326229.3326252","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3326229.3326252","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:59Z","timestamp":1750206359000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3326229.3326252"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,8]]},"references-count":22,"alternative-id":["10.1145\/3326229.3326252","10.1145\/3326229"],"URL":"https:\/\/doi.org\/10.1145\/3326229.3326252","relation":{},"subject":[],"published":{"date-parts":[[2019,7,8]]},"assertion":[{"value":"2019-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}