{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:45Z","timestamp":1750221165608,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["MTM2017-88796-P"],"award-info":[{"award-number":["MTM2017-88796-P"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["MTM2017-88796-P"],"award-info":[{"award-number":["MTM2017-88796-P"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,11]]},"DOI":"10.1145\/3208976.3208981","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T17:46:44Z","timestamp":1531417604000},"page":"327-333","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["The Importance of Being Zero"],"prefix":"10.1145","author":[{"given":"Tom\u00e1s","family":"Recio","sequence":"first","affiliation":[{"name":"Universidad de Cantabria, Santander, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Rafael","family":"Sendra","sequence":"additional","affiliation":[{"name":"Universidad de Alcal\u00e1, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Villarino","sequence":"additional","affiliation":[{"name":"Universidad de Alcal\u00e1, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/3015306.3015309"},{"key":"e_1_3_2_1_2_1","volume-title":"Ideals, Varieties, and Algorithms","author":"Cox D.","year":"2012","unstructured":"Cox , D. , Little , J. , O'Shea , D. ( 2012 ). Ideals, Varieties, and Algorithms . Springer , New York , third edition. Cox, D., Little, J., O'Shea, D. (2012). Ideals, Varieties, and Algorithms. Springer, New York, third edition."},{"key":"e_1_3_2_1_3_1","first-page":"549","volume-title":"Heights of varieties in multiprojective spaces and arithmetics Nullstellens$ddota$tze. Annales scientifiques de l'\u00c9cole Normale Sup\u00e9rieure. Vol 46, issue 4","author":"D'Andrea C.","year":"2013","unstructured":"D'Andrea C. , Krick T. and Sombra M . ( 2013 ). Heights of varieties in multiprojective spaces and arithmetics Nullstellens$ddota$tze. Annales scientifiques de l'\u00c9cole Normale Sup\u00e9rieure. Vol 46, issue 4 , pp. 549 -- 627 . D'Andrea C., Krick T. and Sombra M. (2013). Heights of varieties in multiprojective spaces and arithmetics Nullstellens$ddota$tze. Annales scientifiques de l'\u00c9cole Normale Sup\u00e9rieure. Vol 46, issue 4, pp. 549--627."},{"key":"e_1_3_2_1_4_1","first-page":"195","volume-title":"Le Matemathiche","author":"Ferro A.","year":"1988","unstructured":"Ferro A. and Gallo G . ( 1988 ). Automated theorem proving in elementary geometry . Le Matemathiche , vol. XLIII , pp. 195 -- 224 . Ferro A. and Gallo G. (1988). Automated theorem proving in elementary geometry. Le Matemathiche, vol. XLIII, pp. 195--224."},{"key":"e_1_3_2_1_5_1","first-page":"377","volume-title":"Advances in Computational Mathematics (Special issue on Multivariate polynomial interpolation)","author":"Gasca M.","year":"2000","unstructured":"Gasca M. and Sauer T . ( 2000 ). Advances in Computational Mathematics (Special issue on Multivariate polynomial interpolation) , vol. 12 (2000), pp. 377 -- 410 . Gasca M. and Sauer T. (2000). Advances in Computational Mathematics (Special issue on Multivariate polynomial interpolation), vol. 12 (2000), pp. 377--410."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1016\/0304-3975(83)90002-6"},{"key":"e_1_3_2_1_7_1","first-page":"237","article-title":"Testingpolynomials wich are easy to compute","volume":"30","author":"Heintz J.","year":"1982","unstructured":"Heintz , J. , Schnorr , C.P. ( 1982 ). Testingpolynomials wich are easy to compute , L'Enseignement Math\u00e9matique , 30 , 237 -- 254 . Heintz, J., Schnorr, C.P. (1982). Testingpolynomials wich are easy to compute, L'Enseignement Math\u00e9matique, 30, 237--254.","journal-title":"L'Enseignement Math\u00e9matique"},{"issue":"8","key":"e_1_3_2_1_8_1","first-page":"824","article-title":"Can we prove geometry theorems by computing an example?","volume":"29","author":"Hong J.","year":"1986","unstructured":"Hong J. ( 1986 ). Can we prove geometry theorems by computing an example? . Science China Mathematics. 29 ( 8 ): 824 -- 834 . Hong J. (1986). Can we prove geometry theorems by computing an example?. Science China Mathematics. 29(8): 824--834.","journal-title":"Science China Mathematics."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1109\/SFCS.1986.48"},{"key":"e_1_3_2_1_10_1","volume-title":"Foundations of Dynamic Geometry. Ph. D. thesis. ETH Z\u00fcrich.","author":"Kortenkamp U.","year":"1999","unstructured":"Kortenkamp , U. ( 1999 ). Foundations of Dynamic Geometry. Ph. D. thesis. ETH Z\u00fcrich. Available at http:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.100.2207&rep=rep1&type=pdf Kortenkamp, U. (1999). Foundations of Dynamic Geometry. Ph. D. thesis. ETH Z\u00fcrich. Available at http:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.100.2207&rep=rep1&type=pdf"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of MathUI","author":"Kortenkamp U.","year":"2004","unstructured":"Kortenkamp , U. , Richter-Gebert , J. ( 2004 ): Using automatic theorem proving to improve the usability of geometry software . Proceedings of MathUI , 2004. (Online publication available at https:\/\/www.researchgate.net\/publication\/215908130_Using_Automatic_Theorem_Proving_to_Improve_the_Usability_of_Geometry_Software ). Kortenkamp, U., Richter-Gebert, J. (2004): Using automatic theorem proving to improve the usability of geometry software. Proceedings of MathUI, 2004. (Online publication available at https:\/\/www.researchgate.net\/publication\/215908130_Using_Automatic_Theorem_Proving_to_Improve_the_Usability_of_Geometry_Software )."},{"key":"e_1_3_2_1_12_1","volume-title":"Computer based conjectures and proofs in teaching euclidean geometry. Ph. D. thesis","author":"Kov\u00e1cs Z.","year":"2015","unstructured":"Kov\u00e1cs , Z. ( 2015 ). Computer based conjectures and proofs in teaching euclidean geometry. Ph. D. thesis . Johannes Kepler University , Linz . Available at http:\/\/www.jku.at\/content\/e263\/e16099\/e16086\/e173791?view=PUBD&pub_id=51957 Kov\u00e1cs, Z. (2015). Computer based conjectures and proofs in teaching euclidean geometry. Ph. D. thesis. Johannes Kepler University, Linz. Available at http:\/\/www.jku.at\/content\/e263\/e16099\/e16086\/e173791?view=PUBD&pub_id=51957"},{"key":"e_1_3_2_1_13_1","volume-title":"Prover benchmark for GeoGebra 5.0.65.0 (r38763)","author":"Kov\u00e1cs Z.","year":"2015","unstructured":"Kov\u00e1cs , Z. ( 2015 ) Prover benchmark for GeoGebra 5.0.65.0 (r38763) . http:\/\/test.geogebra.org\/~kovzol\/data\/Prove-20150219b\/ Kov\u00e1cs, Z. (2015) Prover benchmark for GeoGebra 5.0.65.0 (r38763). http:\/\/test.geogebra.org\/~kovzol\/data\/Prove-20150219b\/"},{"key":"e_1_3_2_1_14_1","volume-title":"Prover benchmark for GeoGebra 611. https:\/\/prover-test.geogebra.org\/job\/GeoGebra-provertest\/ws\/test\/scripts\/benchmark\/prover\/html\/all.html","author":"Kov\u00e1cs Z.","year":"2018","unstructured":"Kov\u00e1cs , Z. ( 2018 ). Prover benchmark for GeoGebra 611. https:\/\/prover-test.geogebra.org\/job\/GeoGebra-provertest\/ws\/test\/scripts\/benchmark\/prover\/html\/all.html Kov\u00e1cs, Z. (2018). Prover benchmark for GeoGebra 611. https:\/\/prover-test.geogebra.org\/job\/GeoGebra-provertest\/ws\/test\/scripts\/benchmark\/prover\/html\/all.html"},{"key":"e_1_3_2_1_15_1","volume-title":"the Eight National Conference on Artificial Intelligence. AAAI-90 Proceedings. 240--245","author":"Kounailis E.","year":"1990","unstructured":"Kounailis , E. , Rusinowitch , M. ( 1990 ). Mechanizing inductive reasoning . In the Eight National Conference on Artificial Intelligence. AAAI-90 Proceedings. 240--245 . Kounailis, E., Rusinowitch, M. (1990). Mechanizing inductive reasoning. In the Eight National Conference on Artificial Intelligence. AAAI-90 Proceedings. 240--245."},{"key":"e_1_3_2_1_16_1","volume-title":"G\u00f6del's lost letter and P=NP","author":"Lipton R. J.","year":"2009","unstructured":"Lipton , R. J. (2009). The curious history of the Schwartz-Zippel lema . In G\u00f6del's lost letter and P=NP , Nov. 30, 2009 . Available at https:\/\/rjlipton.wordpress.com\/2009\/11\/30\/the-curious-history-of-the-schwartz-zippel-lemma\/ Lipton, R. J.(2009). The curious history of the Schwartz-Zippel lema. In G\u00f6del's lost letter and P=NP, Nov. 30, 2009. Available at https:\/\/rjlipton.wordpress.com\/2009\/11\/30\/the-curious-history-of-the-schwartz-zippel-lemma\/"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1007\/s00200-002-0112-2"},{"key":"e_1_3_2_1_18_1","volume-title":"Proc. AAECC--11","author":"Pardo L.M.","year":"1995","unstructured":"Pardo , L.M. , ( 1995 ). How lower and upper complexity bounds meet inelimination theory , Proc. AAECC--11 , ( G. Cohen, M.Giusti, T. Mora, eds.), Springer LNCS. 948, 33--69. Pardo, L.M., (1995). How lower and upper complexity bounds meet inelimination theory, Proc. AAECC--11, ( G. Cohen, M.Giusti, T. Mora, eds.), Springer LNCS. 948, 33--69."},{"key":"e_1_3_2_1_19_1","volume-title":"Interactividad y Comprobaci\u00f3n Probabil'\u0131stica de Demostraciones. La Gaceta de la Real Sociedad Matem\u00e1tica Espa\u00f1ola, 15--2. 303--333.","author":"Pardo L.M.","year":"2012","unstructured":"Pardo , L.M. ( 2012 ). La Conjetura de Cook (P = NP?). Parte II: Probabilidad , Interactividad y Comprobaci\u00f3n Probabil'\u0131stica de Demostraciones. La Gaceta de la Real Sociedad Matem\u00e1tica Espa\u00f1ola, 15--2. 303--333. Pardo, L.M. (2012). La Conjetura de Cook (P = NP?). Parte II: Probabilidad, Interactividad y Comprobaci\u00f3n Probabil'\u0131stica de Demostraciones. La Gaceta de la Real Sociedad Matem\u00e1tica Espa\u00f1ola, 15--2. 303--333."},{"key":"e_1_3_2_1_20_1","volume-title":"C\u00e1lculo simb\u00f3lico y geom\u00e9trico. Editor","author":"Recio T.","year":"1998","unstructured":"Recio , T. ( 1998 ). C\u00e1lculo simb\u00f3lico y geom\u00e9trico. Editor ial S\u00edntesis. Madrid . Recio, T. (1998). C\u00e1lculo simb\u00f3lico y geom\u00e9trico. Editorial S\u00edntesis. Madrid."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1023\/A:1006135322108"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/322217.322225"},{"key":"e_1_3_2_1_23_1","volume-title":"Mechanic proof of theorems in plane geometry. Masterarbeit","author":"Weitzhofer S.","year":"2013","unstructured":"Weitzhofer , S. ( 2013 ). Mechanic proof of theorems in plane geometry. Masterarbeit , Johannes Kepler University , Linz . Available at http:\/\/test.geogebra.org\/%7Ekovzol\/guests\/SimonWeitzhofer\/DiplArbeit.pdf Weitzhofer, S. (2013). Mechanic proof of theorems in plane geometry. Masterarbeit, Johannes Kepler University, Linz. Available at http:\/\/test.geogebra.org\/%7Ekovzol\/guests\/SimonWeitzhofer\/DiplArbeit.pdf"},{"key":"e_1_3_2_1_24_1","volume-title":"Commutative Algebra","author":"Zriski O.","year":"1958","unstructured":"Zriski , O. and Samuel , P . ( 1958 ). Commutative Algebra , Vol. 1 , Van Nostrand . Zriski, O. and Samuel, P. (1958). Commutative Algebra, Vol. 1, Van Nostrand."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1016\/0304-3975(90)90077-U"},{"key":"e_1_3_2_1_26_1","volume-title":"EUROSAM","author":"Zippel R.","year":"1979","unstructured":"Zippel R. ( 1979 ). Probabilistic algorithms for sparse polynomials. In: Ng E.W. (eds) Symbolic and Algebraic Computation . EUROSAM 1979. Lecture Notes in Computer Science, vol 72. Springer, Berlin, Heidelberg. Zippel R. (1979). Probabilistic algorithms for sparse polynomials. In: Ng E.W. (eds) Symbolic and Algebraic Computation. EUROSAM 1979. Lecture Notes in Computer Science, vol 72. Springer, Berlin, Heidelberg."}],"event":{"sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"acronym":"ISSAC '18","name":"ISSAC '18: International Symposium on Symbolic and Algebraic Computation","location":"New York NY USA"},"container-title":["Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3208976.3208981","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3208976.3208981","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:48Z","timestamp":1750208928000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3208976.3208981"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":26,"alternative-id":["10.1145\/3208976.3208981","10.1145\/3208976"],"URL":"https:\/\/doi.org\/10.1145\/3208976.3208981","relation":{},"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"2018-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}