{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T07:06:57Z","timestamp":1763536017673,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147876"},{"type":"electronic","value":"9783031147883"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14788-3_17","type":"book-chapter","created":{"date-parts":[[2022,8,10]],"date-time":"2022-08-10T14:24:42Z","timestamp":1660141482000},"page":"300-317","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["New Heuristic to\u00a0Choose a\u00a0Cylindrical Algebraic Decomposition Variable Ordering Motivated by\u00a0Complexity Analysis"],"prefix":"10.1007","author":[{"given":"Tereso","family":"del R\u00edo","sequence":"first","affiliation":[]},{"given":"Matthew","family":"England","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,11]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","unstructured":"\u00c1brah\u00e1m, E., Davenport, J.H., England, M., Kremer, G.: Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings. J. Log. Algebraic Methods Program. 119, 100633 (2021). https:\/\/doi.org\/10.1016\/j.jlamp.2020.100633","DOI":"10.1016\/j.jlamp.2020.100633"},{"key":"17_CR2","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The Satisfiability Modulo Theories Library (SMT-LIB) (2016), www.SMT-LIB.org"},{"key":"17_CR3","doi-asserted-by":"publisher","unstructured":"Bradford, R., Davenport, J.H., England, M., McCallum, S., Wilson, D.: Truth table invariant cylindrical algebraic decomposition. J. Symbol. Comput. 76, 1\u201335, 100633 (2016). https:\/\/doi.org\/10.1016\/J.JSC.2015.11.002","DOI":"10.1016\/J.JSC.2015.11.002"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-39320-4_2","volume-title":"Intelligent Computer Mathematics","author":"R Bradford","year":"2013","unstructured":"Bradford, R., Davenport, J.H., England, M., Wilson, D.: Optimising Problem Formulation for Cylindrical Algebraic Decomposition. In: Carette, J., Aspinall, D., Lange, C., Sojka, P., Windsteiger, W. (eds.) CICM 2013. LNCS (LNAI), vol. 7961, pp. 19\u201334. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39320-4_2"},{"key":"17_CR5","unstructured":"Brown, C.W.: Companion to the tutorial cylindrical algebraic decomposition. In: International Symposium on Symbolic and Algebraic Computation - ISSAC (2004). www.usna.edu\/Users\/cs\/wcbrown\/research\/ISSAC04\/handout.pdf"},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Brown, C.W.: Open non-uniform cylindrical algebraic decompositions. In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC, pp. 85\u201392. Association for Computing Machinery (2015). https:\/\/doi.org\/10.1145\/2755996.2756654","DOI":"10.1145\/2755996.2756654"},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"Brown, C.W., Davenport, J.H.: The complexity of quantifier elimination and cylindrical algebraic decomposition. In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC, pp. 54\u201360 (2007). https:\/\/doi.org\/10.1145\/1277548.1277557","DOI":"10.1145\/1277548.1277557"},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Brown, C.W., Daves, G.C.: Applying machine learning to heuristics for real polynomial constraint solving. In: Bigatti, A.M., Carette, J., Davenport, J.H., Joswig, M., de Wolff, T. (eds.) ICMS 2020. LNCS, vol. 12097, pp. 292\u2013301. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-52200-1_29","DOI":"10.1007\/978-3-030-52200-1_29"},{"key":"17_CR9","doi-asserted-by":"publisher","unstructured":"Chen, C., Moreno Maza, M.: An incremental algorithm for computing cylindrical algebraic decompositions. In: Feng, R., Lee, W., Sato, Y. (eds.) Computer Mathematics, pp. 199\u2013221. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43799-5_17","DOI":"10.1007\/978-3-662-43799-5_17"},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Chen, C., Moreno Maza, M.: Cylindrical Algebraic decomposition in the RegularChains library. In: Hong, H., Yap, C. (eds.) ICMS 2014. LNCS, vol. 8592, pp. 425\u2013433. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44199-2_65","DOI":"10.1007\/978-3-662-44199-2_65"},{"key":"17_CR11","doi-asserted-by":"publisher","unstructured":"Chen, C., Moreno Maza, M., Xia, B., Yang, L.: Computing cylindrical algebraic decomposition via triangular decomposition. In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC, pp. 95\u2013102 (2009). https:\/\/doi.org\/10.1145\/1576702.1576718","DOI":"10.1145\/1576702.1576718"},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Chen, C., Zhu, Z., Chi, H.: Variable ordering selection for cylindrical algebraic decomposition with artificial neural networks. In: Bigatti, A.M., Carette, J., Davenport, J.H., Joswig, M., de Wolff, T. (eds.) ICMS 2020. LNCS, vol. 12097, pp. 281\u2013291. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-52200-1_28","DOI":"10.1007\/978-3-030-52200-1_28"},{"key":"17_CR13","doi-asserted-by":"publisher","unstructured":"Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decompostion. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 134\u2013183. Springer, Heidelberg (1975). https:\/\/doi.org\/10.1007\/3-540-07407-4_17","DOI":"10.1007\/3-540-07407-4_17"},{"key":"17_CR14","doi-asserted-by":"publisher","unstructured":"Collins, G.E.: Quantifier Elimination by Cylindrical Algebraic Decomposition - Twenty Years of Progress. In: Caviness, B.F., Johnson, J.R. (eds.) Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts and Monographs in Symbolic Computation, pp. 8\u201323. Springer, Vienna (1998). https:\/\/doi.org\/10.1007\/978-3-7091-9459-1_2","DOI":"10.1007\/978-3-7091-9459-1_2"},{"key":"17_CR15","doi-asserted-by":"publisher","unstructured":"Dolzmann, A., Seidl, A., Sturm, T.: Efficient projection orders for CAD. In: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, ISSAC, pp. 111\u2013118. ACM Press, New York, New York, USA (2004). https:\/\/doi.org\/10.1145\/1005285.1005303","DOI":"10.1145\/1005285.1005303"},{"key":"17_CR16","doi-asserted-by":"publisher","unstructured":"England, M., Bradford, R., Chen, C., Davenport, J.H., Maza, M.M., Wilson, D.: Problem formulation for truth-table invariant cylindrical algebraic decomposition by incremental triangular decomposition. In: Watt, S.M., Davenport, J.H., Sexton, A.P., Sojka, P., Urban, J. (eds.) CICM 2014. LNCS (LNAI), vol. 8543, pp. 45\u201360. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08434-3_5","DOI":"10.1007\/978-3-319-08434-3_5"},{"key":"17_CR17","doi-asserted-by":"publisher","unstructured":"England, M., Bradford, R., Davenport, J.H.: Improving the use of equational constraints in cylindrical algebraic decomposition. In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC, pp. 165\u2013172 (2015). https:\/\/doi.org\/10.1145\/2755996.2756678","DOI":"10.1145\/2755996.2756678"},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"England, M., Bradford, R., Davenport, J.H.: Cylindrical algebraic decomposition with equational constraints. J. Symbol. Comput. 100, 38\u201371 (2020). https:\/\/doi.org\/10.1016\/j.jsc.2019.07.019","DOI":"10.1016\/j.jsc.2019.07.019"},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"England, M., Florescu, D.: Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition. In: Kaliszyk, C., Brady, E., Kohlhase, A., Sacerdoti Coen, C. (eds.) CICM 2019. LNCS (LNAI), vol. 11617, pp. 93\u2013108. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23250-4_7","DOI":"10.1007\/978-3-030-23250-4_7"},{"key":"17_CR20","unstructured":"Fairley, W.B.: The number of real roots of random polynomials of small degree. Indian J. Stat. Ser. B 38(2), 144\u2013152 (1976), www.jstor.org\/stable\/25052004"},{"key":"17_CR21","doi-asserted-by":"publisher","unstructured":"Florescu, D., England, M.: Algorithmically generating new algebraic features of polynomial systems for machine learning. In: CEUR Workshop Proceedings 2460 (2019). https:\/\/doi.org\/10.48550\/1906.01455","DOI":"10.48550\/1906.01455"},{"key":"17_CR22","doi-asserted-by":"publisher","unstructured":"Florescu, D., England, M.: Improved cross-validation for classifiers that make algorithmic choices to\u00a0minimise runtime without compromising output correctness. In: Slamanig, D., Tsigaridas, E., Zafeirakopoulos, Z. (eds.) MACIS 2019. LNCS, vol. 11989, pp. 341\u2013356. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43120-4_27","DOI":"10.1007\/978-3-030-43120-4_27"},{"key":"17_CR23","doi-asserted-by":"publisher","unstructured":"Huang, Z., England, M., Wilson, D.J., Bridge, J., Davenport, J.H., Paulson, L.C.: Using machine learning to improve cylindrical algebraic decomposition. Math. Comput. Sci. 13(4), 461\u2013488 (dec 2019). https:\/\/doi.org\/10.1007\/s11786-019-00394-8","DOI":"10.1007\/s11786-019-00394-8"},{"key":"17_CR24","doi-asserted-by":"publisher","unstructured":"Kremer, G., \u00c1brah\u00e1m, E.: Fully incremental cylindrical algebraic decomposition. J. Symbol. Comput. 100, 11\u201337 (2020). https:\/\/doi.org\/10.1016\/j.jsc.2019.07.018","DOI":"10.1016\/j.jsc.2019.07.018"},{"key":"17_CR25","doi-asserted-by":"publisher","unstructured":"Li, H., Xia, B., Zhang, H., Zheng, T.: Choosing the variable ordering for cylindrical algebraic decomposition via exploiting chordal structure. In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC, pp. 281\u2013288 (2021). https:\/\/doi.org\/10.1145\/3452143.3465520","DOI":"10.1145\/3452143.3465520"},{"key":"17_CR26","doi-asserted-by":"publisher","unstructured":"McCallum, S., Parusi\u0144ski, A., Paunescu, L.: Validity proof of Lazard\u2019s method for CAD construction. J. Symbol. Comput. 92, 52\u201369 (2019). https:\/\/doi.org\/10.1016\/j.jsc.2017.12.002","DOI":"10.1016\/j.jsc.2017.12.002"},{"key":"17_CR27","doi-asserted-by":"publisher","unstructured":"Wilson, D., England, M., Bradford, R., Davenport, J.H.: Using the distribution of cells by dimension in a cylindrical algebraic decomposition. In: Proceedings - 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2014, pp. 53\u201360 (2015). https:\/\/doi.org\/10.1109\/SYNASC.2014.15","DOI":"10.1109\/SYNASC.2014.15"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14788-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T23:17:36Z","timestamp":1660259856000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14788-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147876","9783031147883"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14788-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CASC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Computer Algebra in Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gebze","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turkey","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"casc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/casc-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.25","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}