{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:59:48Z","timestamp":1760061588136,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030521998"},{"type":"electronic","value":"9783030522001"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-52200-1_30","type":"book-chapter","created":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T18:04:48Z","timestamp":1594145088000},"page":"302-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Machine Learning Based Software Pipeline to Pick the Variable Ordering for Algorithms with Polynomial Inputs"],"prefix":"10.1007","author":[{"given":"Dorian","family":"Florescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"England","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","unstructured":"Alemi, A., Chollet, F., Een, N., Irving, G., Szegedy, C., Urban, J.: DeepMath - deep sequence models for premise selection. In: Proceedings of the NIPS 2016, pp. 2243\u20132251 (2016). \nhttps:\/\/doi.org\/10.5555\/3157096.3157347","DOI":"10.5555\/3157096.3157347"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.jsc.2019.07.008","volume":"98","author":"R Bradford","year":"2020","unstructured":"Bradford, R., et al.: Identifying the parametric occurrence of multiple steady states for some biological networks. J. Symb. Comput. 98, 84\u2013119 (2020). \nhttps:\/\/doi.org\/10.1016\/j.jsc.2019.07.008","journal-title":"J. Symb. Comput."},{"key":"30_CR3","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-39320-4_2"},{"key":"30_CR4","unstructured":"Brown, C.: Companion to the tutorial: cylindrical algebraic decomposition. In: Presented at ISSAC 2004 (2004). \nhttp:\/\/www.usna.edu\/Users\/cs\/wcbrown\/research\/ISSAC04\/handout.pdf"},{"key":"30_CR5","doi-asserted-by":"publisher","unstructured":"Brown, C., Davenport, J.: The complexity of quantifier elimination and cylindrical algebraic decomposition. In: Proceedings of the ISSAC 2007, pp. 54\u201360. ACM (2007). \nhttps:\/\/doi.org\/10.1145\/1277548.1277557","DOI":"10.1145\/1277548.1277557"},{"key":"30_CR6","doi-asserted-by":"publisher","unstructured":"Carette, J.: Understanding expression simplification. In: Proceedings of the ISSAC 2004, pp. 72\u201379. ACM (2004). \nhttps:\/\/doi.org\/10.1145\/1005285.1005298","DOI":"10.1145\/1005285.1005298"},{"key":"30_CR7","series-title":"Texts & Monographs in Symbolic Computation","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-9459-1","volume-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition","author":"B Caviness","year":"1998","unstructured":"Caviness, B., Johnson, J.: Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts & Monographs in Symbolic Computation. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/978-3-7091-9459-1"},{"key":"30_CR8","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 ISSAC 2009, pp. 95\u2013102. ACM (2009). \nhttps:\/\/doi.org\/10.1145\/1576702.1576718","DOI":"10.1145\/1576702.1576718"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.jsc.2015.11.008","volume":"75","author":"C Chen","year":"2016","unstructured":"Chen, C., Moreno Maza, M.: Quantifier elimination by cylindrical algebraic decomposition based on regular chains. J. Symb. Comput. 75, 74\u201393 (2016). \nhttps:\/\/doi.org\/10.1016\/j.jsc.2015.11.008","journal-title":"J. Symb. Comput."},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-07407-4_17","volume-title":"Automata Theory and Formal Languages","author":"GE Collins","year":"1975","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). \nhttps:\/\/doi.org\/10.1007\/3-540-07407-4_17\n\n. Reprinted in [7]"},{"key":"30_CR11","doi-asserted-by":"publisher","unstructured":"Dolzmann, A., Seidl, A., Sturm, T.: Efficient projection orders for CAD. In: Proceedings of the ISSAC 2004, pp. 111\u2013118. ACM (2004). \nhttps:\/\/doi.org\/10.1145\/1005285.1005303","DOI":"10.1145\/1005285.1005303"},{"key":"30_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-319-96418-8_20","volume-title":"Mathematical Software \u2013 ICMS 2018","author":"M England","year":"2018","unstructured":"England, M.: Machine learning for mathematical software. In: Davenport, J.H., Kauers, M., Labahn, G., Urban, J. (eds.) ICMS 2018. LNCS, vol. 10931, pp. 165\u2013174. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-96418-8_20"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.jsc.2019.07.019","volume":"100","author":"M England","year":"2020","unstructured":"England, M., Bradford, R., Davenport, J.: Cylindrical algebraic decomposition with equational constraints. J. Symb. Comput. 100, 38\u201371 (2020). \nhttps:\/\/doi.org\/10.1016\/j.jsc.2019.07.019","journal-title":"J. Symb. Comput."},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-662-44199-2_68","volume-title":"Mathematical Software \u2013 ICMS 2014","author":"M England","year":"2014","unstructured":"England, M., Bradford, R., Davenport, J.H., Wilson, D.: Choosing a variable ordering for truth-table invariant cylindrical algebraic decomposition by incremental triangular decomposition. In: Hong, H., Yap, C. (eds.) ICMS 2014. LNCS, vol. 8592, pp. 450\u2013457. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-44199-2_68"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-030-23250-4_7","volume-title":"Intelligent Computer Mathematics","author":"M England","year":"2019","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). \nhttps:\/\/doi.org\/10.1007\/978-3-030-23250-4_7"},{"key":"30_CR16","unstructured":"Florescu, D., England, M.: Algorithmically generating new algebraic features of polynomial systems for machine learning. In: Proceedings of the $$\\text{SC}^{2}$$ 2019. CEUR-WS, vol. 2460 (2019). \nhttp:\/\/ceur-ws.org\/Vol-2460\/"},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-030-43120-4_27","volume-title":"Mathematical Aspects of Computer and Information Sciences","author":"D Florescu","year":"2020","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). \nhttps:\/\/doi.org\/10.1007\/978-3-030-43120-4_27"},{"issue":"1","key":"30_CR18","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1080\/10586458.2018.1434704","volume":"29","author":"J Gryak","year":"2020","unstructured":"Gryak, J., Haralick, R., Kahrobaei, D.: Solving the conjugacy decision problem via machine learning. Exp. Math. 29(1), 66\u201378 (2020). \nhttps:\/\/doi.org\/10.1080\/10586458.2018.1434704","journal-title":"Exp. Math."},{"issue":"4","key":"30_CR19","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s11786-019-00394-8","volume":"13","author":"Z Huang","year":"2019","unstructured":"Huang, Z., England, M., Wilson, D., Bridge, J., Davenport, J., Paulson, L.: Using machine learning to improve cylindrical algebraic decomposition. Math. Comput. Sci. 13(4), 461\u2013488 (2019). \nhttps:\/\/doi.org\/10.1007\/s11786-019-00394-8","journal-title":"Math. Comput. Sci."},{"key":"30_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-319-08434-3_8","volume-title":"Intelligent Computer Mathematics","author":"Z Huang","year":"2014","unstructured":"Huang, Z., England, M., Wilson, D., Davenport, J.H., Paulson, L.C., Bridge, J.: Applying machine learning to the problem of choosing a heuristic to select the variable ordering for cylindrical algebraic decomposition. In: Watt, S.M., Davenport, J.H., Sexton, A.P., Sojka, P., Urban, J. (eds.) CICM 2014. LNCS (LNAI), vol. 8543, pp. 92\u2013107. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-08434-3_8"},{"key":"30_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cpc.2014.08.008","volume":"189","author":"J Kuipers","year":"2015","unstructured":"Kuipers, J., Ueda, T., Vermaseren, J.: Code optimization in FORM. Comput. Phys. Commun. 189, 1\u201319 (2015). \nhttps:\/\/doi.org\/10.1016\/j.cpc.2014.08.008","journal-title":"Comput. Phys. Commun."},{"key":"30_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-40970-2_9","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"JH Liang","year":"2016","unstructured":"Liang, J.H., Ganesh, V., Poupart, P., Czarnecki, K.: Learning rate based branching heuristic for SAT solvers. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 123\u2013140. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-40970-2_9"},{"key":"30_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-319-96418-8_44","volume-title":"Mathematical Software \u2013 ICMS 2018","author":"CB Mulligan","year":"2018","unstructured":"Mulligan, C.B., Davenport, J.H., England, M.: TheoryGuru: a mathematica package to apply quantifier elimination technology to economics. In: Davenport, J.H., Kauers, M., Labahn, G., Urban, J. (eds.) ICMS 2018. LNCS, vol. 10931, pp. 369\u2013378. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-96418-8_44"},{"key":"30_CR24","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011). \nhttp:\/\/www.jmlr.org\/papers\/v12\/pedregosa11a.html","journal-title":"J. Mach. Learn. Res."},{"key":"30_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/11870814_25","volume-title":"Computer Algebra in Scientific Computing","author":"T Sturm","year":"2006","unstructured":"Sturm, T.: New domains for applied quantifier elimination. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2006. LNCS, vol. 4194, pp. 295\u2013301. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11870814_25"}],"container-title":["Lecture Notes in Computer Science","Mathematical Software \u2013 ICMS 2020"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-52200-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T19:07:47Z","timestamp":1594148867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-52200-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030521998","9783030522001"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-52200-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICMS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Congress on Mathematical Software","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Braunschweig","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icms2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iaa.tu-bs.de\/AppliedAlgebra\/ICMS2020\/ICMS2020.html","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":"58","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":"48","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":"83% - 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":"2.22","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":"3.67","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}