{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:08:01Z","timestamp":1746331681515,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662441985"},{"type":"electronic","value":"9783662441992"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44199-2_68","type":"book-chapter","created":{"date-parts":[[2014,7,31]],"date-time":"2014-07-31T22:17:11Z","timestamp":1406845031000},"page":"450-457","source":"Crossref","is-referenced-by-count":8,"title":["Choosing a Variable Ordering for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition"],"prefix":"10.1007","author":[{"given":"Matthew","family":"England","sequence":"first","affiliation":[]},{"given":"Russell","family":"Bradford","sequence":"additional","affiliation":[]},{"given":"James H.","family":"Davenport","sequence":"additional","affiliation":[]},{"given":"David","family":"Wilson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"68_CR1","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1137\/0213054","volume":"13","author":"D. Arnon","year":"1984","unstructured":"Arnon, D., Collins, G.E., McCallum, S.: Cylindrical algebraic decomposition I: The basic algorithm. SIAM J. Comput.\u00a013, 865\u2013877 (1984)","journal-title":"SIAM J. Comput."},{"key":"68_CR2","doi-asserted-by":"crossref","unstructured":"Bradford, R., Chen, C., Davenport, J.H., England, M., Moreno Maza, M., Wilson, D.: Truth table invariant cylindrical algebraic decomposition by regular chains. To appear: Proc. CASC 2014 (2014), Preprint: http:\/\/opus.bath.ac.uk\/38344\/","DOI":"10.1007\/978-3-319-10515-4_4"},{"key":"68_CR3","doi-asserted-by":"crossref","unstructured":"Bradford, R., Davenport, J.H.: Towards better simplification of elementary functions. In: Proc. ISSAC 2002, pp. 16\u201322. ACM (2002)","DOI":"10.1145\/780506.780509"},{"key":"68_CR4","doi-asserted-by":"crossref","unstructured":"Bradford, R., Davenport, J.H., England, M., McCallum, S., Wilson, D.: Cylindrical algebraic decompositions for boolean combinations. In: Proc. ISSAC 2013, pp. 125\u2013132. ACM (2013)","DOI":"10.1145\/2465506.2465516"},{"key":"68_CR5","unstructured":"Bradford, R., Davenport, J.H., England, M., McCallum, S., Wilson, D.: Truth table invariant cylindrical algebraic decomposition (submitted for publication, 2014), Preprint: http:\/\/opus.bath.ac.uk\/38146\/"},{"key":"68_CR6","series-title":"Lecture Notes in Computer Science","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, vol.\u00a07961, pp. 19\u201334. Springer, Heidelberg (2013)"},{"key":"68_CR7","unstructured":"Brown, C.W.: Companion to the tutorial: Cylindrical algebraic decomposition. Presented at ISSAC 2004 (2004), http:\/\/www.usna.edu\/Users\/cs\/wcbrown\/research\/ISSAC04\/handout.pdf"},{"key":"68_CR8","doi-asserted-by":"crossref","unstructured":"Brown, C.W., Davenport, J.H.: The complexity of quantifier elimination and cylindrical algebraic decomposition. In: Proc. ISSAC 2007, pp. 54\u201360. ACM (2007)","DOI":"10.1145\/1277548.1277557"},{"key":"68_CR9","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1016\/j.jsc.2005.09.011","volume":"41","author":"C.W. Brown","year":"2006","unstructured":"Brown, C.W., El Kahoui, M., Novotni, D., Weber, A.: Algorithmic methods for investigating equilibria in epidemic modelling. J. Symbolic Computation\u00a041, 1157\u20131173 (2006)","journal-title":"J. Symbolic Computation"},{"issue":"3\/4","key":"68_CR10","first-page":"166","volume":"45","author":"C. Chen","year":"2011","unstructured":"Chen, C., Davenport, J.H., Lemaire, F., Moreno Maza, M., Xia, B., Xiao, R., Xie, Y.: Computing the real solutions of polynomial systems with the RegularChains library in Maple. ACM C.C.A.\u00a045(3\/4), 166\u2013168 (2011)","journal-title":"ACM C.C.A."},{"key":"68_CR11","unstructured":"Chen, C., Moreno Maza, M.: An incremental algorithm for computing cylindrical algebraic decompositions. In: Proc. ASCM 2012. Preprint: http:\/\/arxiv.org\/abs\/1210.5543"},{"key":"68_CR12","doi-asserted-by":"crossref","unstructured":"Chen, C., Moreno Maza, M., Xia, B., Yang, L.: Computing cylindrical algebraic decomposition via triangular decomposition. In: Proc. ISSAC 2009, pp. 95\u2013102. ACM (2009)","DOI":"10.1145\/1576702.1576718"},{"key":"68_CR13","doi-asserted-by":"crossref","unstructured":"Collins, G.E.: Quantifier elimination by cylindrical algebraic decomposition \u2013 20 years of progress. In: Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts & Monographs in Symb. Com., pp. 8\u201323. Springer (1998)","DOI":"10.1007\/978-3-7091-9459-1_2"},{"key":"68_CR14","doi-asserted-by":"crossref","unstructured":"Davenport, J.H., Bradford, R., England, M., Wilson, D.: Program verification in the presence of complex numbers, functions with branch cuts etc. In: Proc. 14th SYNASC 2012, pp. 83\u201388. IEEE (2012)","DOI":"10.1109\/SYNASC.2012.68"},{"key":"68_CR15","doi-asserted-by":"crossref","unstructured":"Dolzmann, A., Seidl, A., Sturm, T.: Efficient projection orders for CAD. In: Proc. ISSAC 2004, pp. 111\u2013118. ACM (2004)","DOI":"10.1145\/1005285.1005303"},{"key":"68_CR16","series-title":"LNAI","first-page":"45","volume-title":"CICM 2014","author":"M. England","year":"2014","unstructured":"England, M., Bradford, R., Chen, C., Davenport, J.H., Moreno Maza, M., Wilson, D.: Problem formulation for truth-table invariant cylindrical algebraic decomposition by incremental triangular decomposition. In: Watt, S.M. (ed.) CICM 2014. LNCS (LNAI), vol.\u00a08543, pp. 45\u201360. Springer, Heidelberg (2014), Preprint: http:\/\/opus.bath.ac.uk\/39231\/"},{"key":"68_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-642-39320-4_9","volume-title":"Intelligent Computer Mathematics","author":"M. England","year":"2013","unstructured":"England, M., Bradford, R., Davenport, J.H., Wilson, D.: Understanding branch cuts of expressions. In: Carette, J., Aspinall, D., Lange, C., Sojka, P., Windsteiger, W. (eds.) CICM 2013. LNCS, vol.\u00a07961, pp. 136\u2013151. Springer, Heidelberg (2013)"},{"key":"68_CR18","unstructured":"Fotiou, I.A., Parrilo, P.A., Morari, M.: Nonlinear parametric optimization using cylindrical algebraic decomposition. In: Proc. CDC-ECC 2005, pp. 3735\u20133740 (2005)"},{"key":"68_CR19","series-title":"LNAI","first-page":"92","volume-title":"CICM 2014","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. (ed.) CICM 2014. LNCS (LNAI), vol.\u00a08543, pp. 92\u2013107. Springer, Heidelberg (2014), Preprint: http:\/\/opus.bath.ac.uk\/39232\/"},{"key":"68_CR20","doi-asserted-by":"crossref","unstructured":"McCallum, S.: An improved projection operation for cylindrical algebraic decomposition. In: Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts & Monographs in Symb. Comp., pp. 242\u2013268. Springer (1998)","DOI":"10.1007\/978-3-7091-9459-1_12"},{"key":"68_CR21","doi-asserted-by":"crossref","unstructured":"McCallum, S.: On projection in CAD-based quantifier elimination with equational constraint. In: Proc. ISSAC 1999, pp. 145\u2013149. ACM (1999)","DOI":"10.1145\/309831.309892"},{"key":"68_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-32347-8_1","volume-title":"Interactive Theorem Proving","author":"L.C. Paulson","year":"2012","unstructured":"Paulson, L.C.: Metitarski: Past and future. In: Beringer, L., Felty, A. (eds.) ITP 2012. LNCS, vol.\u00a07406, pp. 1\u201310. Springer, Heidelberg (2012)"},{"key":"68_CR23","doi-asserted-by":"crossref","unstructured":"Wilson, D., Davenport, J.H., England, M., Bradford, R.: A \u201cpiano movers\u201d problem reformulated. In: Proc. SYNASC 2013, pp. 53\u201360. IEEE (2014)","DOI":"10.1109\/SYNASC.2013.14"},{"key":"68_CR24","unstructured":"The RegularChains Library, http:\/\/www.regularchains.org"}],"container-title":["Lecture Notes in Computer Science","Mathematical Software \u2013 ICMS 2014"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44199-2_68","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T01:22:33Z","timestamp":1746321753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44199-2_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662441985","9783662441992"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44199-2_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}