{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T09:40:29Z","timestamp":1737366029305,"version":"3.33.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T00:00:00Z","timestamp":1187049600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2007,11,16]]},"DOI":"10.1007\/s00200-007-0052-y","type":"journal-article","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T12:00:57Z","timestamp":1187006457000},"page":"513-543","source":"Crossref","is-referenced-by-count":6,"title":["Testing elementary function identities using CAD"],"prefix":"10.1007","volume":"18","author":[{"given":"James C.","family":"Beaumont","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Russell J.","family":"Bradford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James H.","family":"Davenport","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nalina","family":"Phisanbut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,8,14]]},"reference":[{"key":"52_CR1","unstructured":"Abramowitz, M., Stegun, I.: Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. US Government Printing Office (1964; 10th printing, 1972)"},{"issue":"1\/2","key":"52_CR2","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0747-7171(88)80012-9","volume":"5","author":"D.S. Arnon","year":"1988","unstructured":"Arnon D.S. (1988). A cluster-based CAD algorithm. J. Symb. Comput. 5(1\/2): 189\u2013212","journal-title":"J. Symb. Comput."},{"key":"52_CR3","doi-asserted-by":"crossref","unstructured":"Bradford, R., Davenport, J.H.: Towards better simplification of elementary functions. In: Mora, T. (ed.) Proceedings of ISSAC, Lille, 7\u201310 July, pp. 15\u201322. ACM, New York (2002)","DOI":"10.1145\/780506.780509"},{"key":"52_CR4","doi-asserted-by":"crossref","unstructured":"Beaumont, J.C., Bradford, R., Davenport, J.H.: Better simplification of elementary functions through power series. In: Sendra, J.R. (ed.) Proceedings of ISSAC, Philadelphia, 3\u20136 August, pp. 30\u201336. ACM, New York (2003)","DOI":"10.1145\/860854.860867"},{"key":"52_CR5","doi-asserted-by":"crossref","unstructured":"Beaumont, J.C., Bradford, R., Davenport, J.H., Phisanbut, N.: A Poly-algorithmic approach to simplifying elementary functions. In: Guttierez, J. (ed.) Proceedings of ISSAC, Santander, 4\u20137 July, pp. 30\u201336. ACM, New York (2004)","DOI":"10.1145\/1005285.1005292"},{"key":"52_CR6","unstructured":"Beaumont, J. C., Bradford, R., Phisanbut, N.: Practical simplification of elementary functions using CAD. In: Dolzmann, A., Seidl, A., Sturm, T. (eds.) Proceedings of Algorithmic Algebra and Logic, Passau, 3\u20136 April. Books on Demand GmbH, Norderstedt, Germany (2005)"},{"key":"52_CR7","doi-asserted-by":"crossref","unstructured":"Beaumont, J.C., Bradford, R., Davenport, J.H., Phisanbut, N.: Adherence is better than adjacency: computing the riemann index using CAD. In: Kauers Editor, M. (ed.) Proceedings of ISSAC, Beijing, 24\u201327 July, pp. 37\u201345. ACM, New York (2005)","DOI":"10.1145\/1073884.1073892"},{"key":"52_CR8","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1023\/A:1016007415899","volume":"36","author":"R. Bradford","year":"2002","unstructured":"Bradford R., Corless R., Davenport J., Jeffrey D. and Watt S. (2002). Reasoning about the elementary functions of complex analysis. Ann. Math. Artif. Intel. 36: 303\u2013318","journal-title":"Ann. Math. Artif. Intel."},{"key":"52_CR9","unstructured":"Brown, C.: Companion to the Tutorial Cylindrical Algebraic Decomposition, Presented at ISSAC 2004. Available at: www.cs.usna.edu\/\u223cwcbrown\/research\/ISSAC04\/Tutorial.html"},{"key":"52_CR10","doi-asserted-by":"crossref","unstructured":"Brown, C., McCallum, S.: On Using Bi-equational constraints in CAD construction. In: Kauers, M. (ed.) Proceedings of ISSAC, Beijing, pp. 76\u201384. ACM, New York (2005)","DOI":"10.1145\/1073884.1073897"},{"key":"52_CR11","doi-asserted-by":"crossref","unstructured":"Collins, G.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: Proceedings of 2nd GI Conference Automata Theory & Formal Languages, vol. 33 of Springer Lecture Notes in Computer Science (1975)","DOI":"10.1007\/3-540-07407-4_17"},{"issue":"3","key":"52_CR12","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0747-7171(08)80152-6","volume":"12","author":"G. Collins","year":"1991","unstructured":"Collins G. and Hong H. (1991). Partial CAD for quantifier elimination. J. Symb. Comput. 12(3): 299\u2013328","journal-title":"J. Symb. Comput."},{"issue":"3","key":"52_CR13","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1006\/jsco.2001.0499","volume":"33","author":"G. Collins","year":"2002","unstructured":"Collins G. and McCallum S. (2002). Local box adjacency algorithms for CAD. J. Symb. Comput. 33(3): 321\u2013342","journal-title":"J. Symb. Comput."},{"issue":"2","key":"52_CR14","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/362001.362023","volume":"34","author":"R. Corless","year":"2002","unstructured":"Corless R., Davenport J., Jeffrey D. and Watt S. (2002). According to Abramowitz and Stegun. SIGSAM Bull. 34(2): 58\u201365","journal-title":"SIGSAM Bull."},{"issue":"2 issue 116","key":"52_CR15","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/235699.235705","volume":"30","author":"R. Corless","year":"1996","unstructured":"Corless R. and Jeffrey D. (1996). The unwinding number. SIGSAM Bull. 30(2 issue 116): 28\u201335","journal-title":"SIGSAM Bull."},{"key":"52_CR16","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0747-7171(88)80004-X","volume":"5","author":"J. Davenport","year":"1988","unstructured":"Davenport J. and Heintz J. (1988). Real quantifier elimination is doubly exponential. J. Symb. Comput. 5: 29\u201335","journal-title":"J. Symb. Comput."},{"key":"52_CR17","doi-asserted-by":"crossref","unstructured":"Dolzmann, A, Seidl, A, Sturm, T.: Efficient projection orders for CAD. In: Guttierez, J. (ed.) Proceedings of ISSAC, Santander, 4\u20137 July, pp. 111\u2013118. ACM, New York (2004)","DOI":"10.1145\/1005285.1005303"},{"key":"52_CR18","doi-asserted-by":"crossref","unstructured":"Fateman, R.J., Dingle, A.: Branch cuts in computer algebra. In: Giesbrecht, M. (ed.) Proceedings of ISSAC, Oxford, 20\u201322 July, pp. 250\u2013257. ACM Press, New York (1994)","DOI":"10.1145\/190347.190424"},{"key":"52_CR19","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01202001","volume":"2","author":"D.Yu. Grigoryev","year":"1992","unstructured":"Grigoryev D.Yu. and Vorobjov N. (1992). Counting connected components of a semi-algebraic set in subexponential time. Comput. Complex. 2: 133\u2013184","journal-title":"Comput. Complex."},{"issue":"3 issue 149","key":"52_CR20","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/1040034.1040036","volume":"38","author":"D.J. Jeffrey","year":"2004","unstructured":"Jeffrey D.J. and Norman A.C. (2004). Not seeing the roots for the branches: multivalued functions in computer algebra. SIGSAM Bull. 38(3 issue 149): 57\u201366","journal-title":"SIGSAM Bull."},{"key":"52_CR21","first-page":"165","volume-title":"The State of Art in Numerical Analysis: Proc. Joint IMA\/SIAM, U.N.","author":"W. Kahan","year":"1987","unstructured":"Kahan W. (1987). Branch cuts for complex elementary functions. In: Iserles, A. and Powell, M. (eds) The State of Art in Numerical Analysis: Proc. Joint IMA\/SIAM, U.N., pp 165\u2013211. Clarendon Press, New York"},{"key":"52_CR22","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/235699.235703","volume":"116","author":"C.M. Patton","year":"1996","unstructured":"Patton C.M. (1996). A representation of branch-cut information. SIGSAM Bull. 116: 21\u201324","journal-title":"SIGSAM Bull."},{"key":"52_CR23","unstructured":"Hong, H. et\u00a0al.: Quantifier Elimination by Partial Cylindrical Algebraic Decomposition. Available at: http:\/\/www.cs.usna.edu\/\u223cqepcad\/B\/QEPCAD.html"},{"key":"52_CR24","doi-asserted-by":"crossref","first-page":"514","DOI":"10.2307\/2271358","volume":"33","author":"D. Richardson","year":"1968","unstructured":"Richardson D. (1968). Some unsolvable problems involving elementary functions of a real variable. J. Symb. Logic 33: 514\u2013520","journal-title":"J. Symb. Logic"},{"key":"52_CR25","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/235699.235704","volume":"116","author":"A. Rich","year":"1996","unstructured":"Rich A. and Jeffrey D. (1996). Function evaluation on branch cuts. SIGSAM Bull. 116: 25\u201327","journal-title":"SIGSAM Bull."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-007-0052-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-007-0052-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-007-0052-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T09:11:48Z","timestamp":1737364308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-007-0052-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,14]]},"references-count":25,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2007,11,16]]}},"alternative-id":["52"],"URL":"https:\/\/doi.org\/10.1007\/s00200-007-0052-y","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"type":"print","value":"0938-1279"},{"type":"electronic","value":"1432-0622"}],"subject":[],"published":{"date-parts":[[2007,8,14]]}}}