{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:30:50Z","timestamp":1761597050731},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425984"},{"type":"electronic","value":"9783540454106"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","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":[[2001]]},"DOI":"10.1007\/3-540-45410-1_5","type":"book-chapter","created":{"date-parts":[[2007,11,5]],"date-time":"2007-11-05T12:16:33Z","timestamp":1194264993000},"page":"58-82","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Randomized Xero Testing of Radical Expressions and Elementary Geometry Theorem Proving"],"prefix":"10.1007","author":[{"given":"Daniela","family":"Tulone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chee","family":"Yap","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,11]]},"reference":[{"key":"5_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-51082-6_74","volume-title":"Proc. 5th Int. Conf. on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"G. C. Ferro","year":"1989","unstructured":"G. Carr\u2019 Ferro and G. Gallo. A procedure to prove geometrical statements. In L. Huguet and A. Poli, editors, Proc. 5th Int. Conf. on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, volume 356 of LNCS, pages 141\u2013150. Springer, Berlin, 1989."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"G. Carr\u2019 Ferro, G. Gallo, and R. Gennaro. Probabilistic verification of elementary geometry statements. In D. Wang, editor, Proc. Int. Workshop on Automated Deduction in Geometry (ADG-96), volume 1360 of LNAI, pages 87\u2013101. Springer, Berlin, 1997.","DOI":"10.1007\/BFb0022721"},{"key":"5_CR3","series-title":"Contemporary Mathematics","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1090\/conm\/029\/14","volume-title":"Automated Theorem Proving: After 25 Years","author":"S.-C. Chou","year":"1984","unstructured":"S.-C. Chou. Proving elementary geometry theorems using Wu\u2019s algorithm. In W. W. Bledsoe and D. W. Loveland, editors, Automated Theorem Proving: After 25 Years, volume 29 of Contemporary Mathematics, pages 243\u2013286. American Mathematical Society, Providence, Rhode Island, 1984."},{"key":"5_CR4","series-title":"Technical Report","volume-title":"Proving geometry theorems using Wu\u2019s method: A collection of geometry theorems proved mechanically","author":"S.-C. Chou","year":"1986","unstructured":"S.-C. Chou. Proving geometry theorems using Wu\u2019s method: A collection of geometry theorems proved mechanically. Technical Report 50, Institute for Computing Science, University of Texas, Austin, July 1986."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"S.-C. Chou. Mechanical Geomtry Theorem Proving. D. Reidel Publishing Company, 1988.","DOI":"10.1007\/978-94-009-4037-6"},{"key":"5_CR6","unstructured":"P. Conti and C. Traverso. Proving real geometry theorems and the computation of the real radical. In J. Richter-Gebert and D. Wang, editors, Proc. 3rd Int. Workshop on Automated Deduction in Geometry (ADG 2000), pages 109\u2013120. Zurich, Switzerland, Sept. 2000."},{"key":"5_CR7","first-page":"195","volume":"XLIII","author":"A. Ferro","year":"1988","unstructured":"A. Ferro and G. Gallo. Automatic theorem proving in elementary geometry. Le Matematiche, XLIII(fasc. I):195\u2013224, 1988.","journal-title":"Le Matematiche"},{"key":"5_CR8","volume-title":"Tesi di dottorato","author":"G. Gallo","year":"1989","unstructured":"G. Gallo. La Dimostrazione Automatica in Geometria e Questioni di Complessit\u00e0 Correlate. Tesi di dottorato, University of Catania, Italy, 1989."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"G. Gallo and B. Mishra. Efficient algorithms and bounds forWu-Ritt characteristic sets. In F. Mora and C. Traverso, editors, Effective Methods in Algebraic Geometry (Proc. MEGA\u201990), volume 94 of Progress in Mathematics, pages 119\u2013142. Birkh\u00e4user, Boston, 1991.","DOI":"10.1007\/978-1-4612-0441-1_8"},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1090\/dimacs\/006\/07","volume-title":"Computational Geometry: Papers from the DIMACS Special Year","author":"G. Gallo","year":"1991","unstructured":"G. Gallo and B. Mishra. Wu-Ritt characteristic sets and their complexity. In Computational Geometry: Papers from the DIMACS Special Year, volume 6, pages 111\u2013136. AMS and ACM, New York, 1991."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"J.-W. Hong. Proving by example and gap theorem. In Proc. 27th Annual Symposium on Foundations of Computer Science, pages 107\u2013116. IEEE, 1986.","DOI":"10.1109\/SFCS.1986.48"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/S0747-7171(86)80007-4","volume":"2","author":"D. Kapur","year":"1986","unstructured":"D. Kapur. Using Gr\u00f6bner bases to reason about geometry problems. Journal of Symbolic Computation, 2:399\u2013412, 1986.","journal-title":"Journal of Symbolic Computation"},{"key":"5_CR13","first-page":"351","volume-title":"Proc. 15th ACM Symp. on Computational Geometry","author":"V. Karamcheti","year":"1999","unstructured":"V. Karamcheti, C. Li, I. Pechtchanski, and C. K. Yap. A core library for robust numeric and geometric computation. In Proc. 15th ACM Symp. on Computational Geometry, pages 351\u2013359. ACM Press, New York, 1999."},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/32439.32480","volume-title":"Proc. Symp. on Symbolic and Algebraic Computation","author":"B. Kutzler","year":"1986","unstructured":"B. Kutzler and S. Stifter. Automated geometry theorem proving using Buchberger\u2019s algorithm. In Proc. Symp. on Symbolic and Algebraic Computation, pages 209\u2013214. ACM Press, New York, 1986."},{"key":"5_CR15","series-title":"PhD thesis","volume-title":"Exact Geometric Computation: Theory and Applications","author":"C. Li","year":"2001","unstructured":"C. Li. Exact Geometric Computation: Theory and Applications. PhD thesis, Courant Institute of Mathematical Sciences, New York University, Jan. 2001. URL: \n                  http:\/\/www.cs.nyu.edu\/csweb\/Research\/theses.html\n                  \n                ."},{"key":"5_CR16","unstructured":"C. Li and C. K. Yap. A new constructive root bound for algebraic expressions. In Proc. 12th ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pages 496\u2013505. ACM and SIAM, 2001."},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0001-8708(82)90048-2","volume":"46","author":"E. W. Mayr","year":"1982","unstructured":"E. W. Mayr and A. R. Meyer. The complexity of the word problems for commutative semigroups and polynomial ideals. Advances in Mathematics, 46:305\u2013329, 1982.","journal-title":"Advances in Mathematics"},{"key":"5_CR18","unstructured":"K. Mehlhorn and S. Schirra. A generalized and improved constructive separation bound for real algebraic expressions. Technical Report MPI-I-2000-004, Max-Planck-Institut f\u00fcr Informatik, Nov. 2000."},{"key":"5_CR19","volume-title":"Master thesis","author":"K. Ouchi","year":"1997","unstructured":"K. Ouchi. Real\/Expr: Implementation of an exact computation package. Master thesis, Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, Jan. 1997."},{"issue":"4","key":"5_CR20","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J. T. Schwartz","year":"1980","unstructured":"J. T. Schwartz. Probabilistic verification of polynomial identities. J. ACM, 27(4): 701\u2013717, 1980.","journal-title":"J. ACM"},{"key":"5_CR21","first-page":"157","volume":"21","author":"W.-T. Wu","year":"1978","unstructured":"W.-T. Wu. On decision problem and the mechanization of theorem proving in elementary geometry. Scientia Sinica, 21:157\u2013179, 1978.","journal-title":"Scientia Sinica"},{"key":"5_CR22","first-page":"235","volume-title":"Automated Theorem Proving: After 25 Years, volume 29 of Contemporary Mathematics","author":"W.-T. Wu","year":"1984","unstructured":"W.-T. Wu. Some recent advances in mechanical theorem proving of geometries. In W. W. Bledsoe and D. W. Loveland, editors, Automated Theorem Proving: After 25 Years, volume 29 of Contemporary Mathematics, pages 235\u2013242. American Mathematical Society, Providence, Rhode Island, 1984."},{"issue":"4","key":"5_CR23","first-page":"221","volume":"2","author":"W.-T. Wu","year":"1986","unstructured":"W.-T. Wu. Basic principles of mechanical theorem proving in elementary geometries. Journal of Automated Reasoning, 2(4):221\u2013252, 1986.","journal-title":"Journal of Automated Reasoning"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0747-7171(08)80138-1","volume":"12","author":"C. K. Yap","year":"1991","unstructured":"C. K. Yap. A new lower bound construction for commutative Thue systems, with applications. Journal of Symbolic Computation, 12:1\u201328, 1991.","journal-title":"Journal of Symbolic Computation"},{"key":"5_CR25","unstructured":"C. K. Yap. Robust geometric computation. In J. E. Goodman and J. O\u2019Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 35, pages 653\u2013668. CRC Press LLC, 1997."},{"key":"5_CR26","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0925-7721(95)00040-2","volume":"7","author":"C. K. Yap","year":"1997","unstructured":"C. K. Yap. Towards exact geometric computation. Computational Geometry: Theory and Applications, 7:3\u201323, 1997. Invited talk, Proc. 5th Canadian Conference on Computational Geometry, Waterloo, Aug. 5-9, 1993.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"R. Zippel. Effective Polynomial Computation. Kluwer Academic Publishers, 1993.","DOI":"10.1007\/978-1-4615-3188-3"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction in Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45410-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:53:42Z","timestamp":1558277622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45410-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425984","9783540454106"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-45410-1_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"11 September 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}