{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T11:40:47Z","timestamp":1762774847252,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,28]]},"DOI":"10.1145\/3747199.3747547","type":"proceedings-article","created":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T10:51:17Z","timestamp":1762771877000},"page":"62-69","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Number of Real Types of Univariate Polynomials"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-4419-2337","authenticated-orcid":false,"given":"Nicolas","family":"Faro\u00df","sequence":"first","affiliation":[{"name":"Saarland University, Saarbr\u00fccken, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8088-340X","authenticated-orcid":false,"given":"Thomas","family":"Sturm","sequence":"additional","affiliation":[{"name":"CNRS, Inria, and the University of Lorraine, Nancy, France"}]}],"member":"320","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"publisher","unstructured":"Andreas Dolzmann and Thomas Sturm. 1997. Redlog: Computer Algebra Meets Computer Logic. ACM SIGSAM Bulletin 31 2 (June 1997) 2\u20139. 10.1145\/261320.261324","DOI":"10.1145\/261320.261324"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59932-311"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03858-8"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","unstructured":"Dima Grigoriev Alexandru Iosif Hamid Rahkooy Thomas Sturm and Andreas Weber. 2020. Efficiently and Effectively Recognizing Toricity of Steady State Varieties. Math. Comput. Sci. 15 2 (2020) 199\u2013232. 10.1007\/s11786-020-00479-9","DOI":"10.1007\/s11786-020-00479-9"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"publisher","unstructured":"Hoon Hong. 1993. Quantifier Elimination for Formulas Constrained by Quadratic Equations via Slope Resultants. THE Computer Journal 36 5 (1993) 440\u2013449. 10.1093\/comjnl\/36.5.439","DOI":"10.1093\/comjnl\/36.5.439"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/b138375"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"publisher","unstructured":"Donald\u00a0E. Knuth. 1976. Big Omicron and Big Omega and Big Theta. SIGACT News 8 2 (April 1976) 18\u201324. 10.1145\/1008328.1008329","DOI":"10.1145\/1008328.1008329"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.22028\/D291-26679"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/1153223122"},{"key":"e_1_3_3_2_11_2","volume-title":"Quantifier Elimination following Muchnik","author":"Michaux Christian","year":"2002","unstructured":"Christian Michaux and Adem Ozturk. 2002. Quantifier Elimination following Muchnik. Preprint\u00a010. Universit\u00e9 de Mons-Hainaut. Institut de Math\u00e9matique, Mons, Belgium."},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.3386\/w24602"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1201\/9781439864500"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-85165-118"},{"key":"e_1_3_3_2_15_2","unstructured":"Hans Schoutens. 2001. Muchnik\u2019s Proof of Tarski\u2013Seidenberg. Online on ResearchGate. https:\/\/www.researchgate.net\/publication\/265186731_MUCHNIK\u2019S_PROOF_OF_TARSKI-SEIDENBERG"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","unstructured":"Thomas Sturm. 2017. A Survey of Some Methods for Real Quantifier Elimination Decision and Satisfiability and Their Applications. Math. Comput. Sci. 11 3\u20134 (December 2017) 483\u2013502. 10.1007\/s11786-017-0319-z","DOI":"10.1007\/s11786-017-0319-z"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.13140\/RG.2.2.32377.16485\/1"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-41258-613"},{"key":"e_1_3_3_2_19_2","unstructured":"Zak Tonks. 2021. Poly-algorithmic Techniques in Real Quantifier Elimination. Doctoral Thesis. University of Bath UK. https:\/\/researchportal.bath.ac.uk\/en\/studentTheses\/poly-algorithmic-techniques-in-real-quantifier-elimination"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511987045"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/190347.190425"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"publisher","unstructured":"Volker Weispfenning. 1997. Quantifier Elimination for Real Algebra\u2014the Quadratic Case and Beyond. Appl. Algebr. Eng. Comm. 8 2 (Feb. 1997) 85\u2013101. 10.1007\/s002000050055","DOI":"10.1007\/s002000050055"}],"event":{"name":"ISSAC '25: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Guanajuato Mexico","acronym":"ISSAC '25"},"container-title":["Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3747199.3747547","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T11:38:48Z","timestamp":1762774728000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3747199.3747547"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,28]]},"references-count":21,"alternative-id":["10.1145\/3747199.3747547","10.1145\/3747199"],"URL":"https:\/\/doi.org\/10.1145\/3747199.3747547","relation":{},"subject":[],"published":{"date-parts":[[2025,7,28]]},"assertion":[{"value":"2025-11-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}