{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T13:18:24Z","timestamp":1776086304617,"version":"3.50.1"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T00:00:00Z","timestamp":1542758400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T00:00:00Z","timestamp":1542758400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Action de Recherche Concert\u00e9e","award":["4.110.H.000023"],"award-info":[{"award-number":["4.110.H.000023"]}]},{"DOI":"10.13039\/100010629","name":"Fulbright Association","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010629","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1229185"],"award-info":[{"award-number":["CNS-1229185"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1319648"],"award-info":[{"award-number":["CCF-1319648"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002661","name":"Fonds De La Recherche Scientifique - FNRS","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003134","name":"Fonds pour la Formation \u00e0 la Recherche dans l\u2019Industrie et dans l\u2019Agriculture","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003134","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["892\/13"],"award-info":[{"award-number":["892\/13"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s00454-018-0040-y","type":"journal-article","created":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T15:04:40Z","timestamp":1542812680000},"page":"698-734","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Subquadratic Algorithms for Algebraic 3SUM"],"prefix":"10.1007","volume":"61","author":[{"given":"Luis","family":"Barba","sequence":"first","affiliation":[]},{"given":"Jean","family":"Cardinal","sequence":"additional","affiliation":[]},{"given":"John","family":"Iacono","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5733-1383","authenticated-orcid":false,"given":"Aur\u00e9lien","family":"Ooms","sequence":"additional","affiliation":[]},{"given":"Noam","family":"Solomon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Abboud, A., Vassilevska Williams, V.: Popular conjectures imply strong lower bounds for dynamic problems. In: Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201914), pp. 434\u2013443. IEEE, Los Alamitos (2014)","DOI":"10.1109\/FOCS.2014.53"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Abboud, A.: Vassilevska Williams, V., Weimann, O.: Consequences of faster alignment of sequences. Automata, Languages, and Programming, Part I (ICALP\u201914). Lecture Notes in Computer Science, vol. 8572, pp. 39\u201351. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-662-43948-7_4"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Abboud, A., Vassilevska Williams, V., Yu, H.: Matching triangles and basing hardness on an extremely popular conjecture. In: Proceedings of the 47th ACM Symposium on Theory of Computing (STOC\u201915), pp. 41\u201350. ACM, New York (2015)","DOI":"10.1145\/2746539.2746594"},{"issue":"2","key":"40_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/1059513.1059515","volume":"52","author":"N Ailon","year":"2005","unstructured":"Ailon, N., Chazelle, B.: Lower bounds for linear degeneracy testing. J. ACM 52(2), 157\u2013171 (2005)","journal-title":"J. ACM"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"Amir, A., Chan, T.M., Lewenstein, M., Lewenstein, N.: On hardness of jumbled indexing. Automata, Languages, and Programming, Part I (ICALP\u201914). Lecture Notes in Computer Science, vol. 8572, pp. 114\u2013125. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-662-43948-7_10"},{"issue":"4","key":"40_CR6","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/s00453-007-9036-3","volume":"50","author":"I Baran","year":"2008","unstructured":"Baran, I., Demaine, E.D., P\u0103tracu, M.: Subquadratic algorithms for 3SUM. Algorithmica 50(4), 584\u2013596 (2008)","journal-title":"Algorithmica"},{"issue":"4","key":"40_CR7","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1142\/S0218195901000596","volume":"11","author":"G Barequet","year":"2001","unstructured":"Barequet, G., Har-Peled, S.: Polygon containment and translational min Hausdorff-distance between segment sets are 3SUM-hard. Int. J. Comput. Geom. Appl. 11(4), 465\u2013474 (2001)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Basu, S., Pollack, R., Roy, M.-F.: Computing roadmaps of semi-algebraic sets (extended abstract). In: Proceedings of the 28th ACM Symposium on Theory of Computing (STOC\u201996), pp. 168\u2013173. ACM, New York (1996)","DOI":"10.1145\/237814.237857"},{"key":"40_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-33099-2","volume-title":"Algorithms in Real Algebraic Geometry","author":"S Basu","year":"2006","unstructured":"Basu, S., Pollack, R., Roy, M.F.: Algorithms in Real Algebraic Geometry. Algorithms and Computation in Mathematics. Springer, Berlin (2006)"},{"issue":"2","key":"40_CR10","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/s00453-012-9734-3","volume":"69","author":"D Bremner","year":"2014","unstructured":"Bremner, D., Chan, T.M., Demaine, E.D., Erickson, J., Hurtado, F., Iacono, J., Langerman, S., P\u0103tra\u015fcu, M., Taslakian, P.: Necklaces, convolutions, and X+Y. Algorithmica 69(2), 294\u2013314 (2014)","journal-title":"Algorithmica"},{"issue":"5","key":"40_CR11","doi-asserted-by":"publisher","first-page":"1552","DOI":"10.1137\/S0097539796260321","volume":"28","author":"H Br\u00f6nnimann","year":"1999","unstructured":"Br\u00f6nnimann, H., Chazelle, B., Matou\u0161ek, J.: Product range spaces, sensitive sampling, and derandomization. SIAM J. Comput. 28(5), 1552\u20131575 (1999)","journal-title":"SIAM J. Comput."},{"key":"40_CR12","unstructured":"Cardinal, J., Iacono, J., Ooms, A.: Solving $$k$$-SUM using few linear queries. In: Sankowski, P., Zaroliagis, C. (eds.) 24th Annual European Symposium on Algorithms (ESA\u201916). LIPIcs. Leibniz International Proceedings in Informatics, 57, pp. 25:1\u201325:17. Schloss Dagstuhl. Leibniz-Zentrum f\u00fcr Informatik, Wadern (2016)"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Carmosino, M.L., Gao, J., Impagliazzo, R., Mihajlin, I., Paturi, R., Schneider, S.: Nondeterministic extensions of the strong exponential time hypothesis and consequences for non-reducibility. In: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (ITCS\u201916), pp. 261\u2013270. ACM, New York (2016)","DOI":"10.1145\/2840728.2840746"},{"key":"40_CR14","volume-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition","year":"1998","unstructured":"Caviness, B.F., Johnson, J.R. (eds.): Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts and Monographs in Symbolic Computation. Springer, Vienna (1998)"},{"issue":"2","key":"40_CR15","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/s00453-007-9062-1","volume":"50","author":"TM Chan","year":"2008","unstructured":"Chan, T.M.: All-pairs shortest paths with real weights in $${O}(n^3\/{\\log }\\, n)$$ time. Algorithmica 50(2), 236\u2013243 (2008)","journal-title":"Algorithmica"},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: More logarithmic-factor speedups for 3SUM, (median,+)-convolution, and some geometric 3SUM-hard problems. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201918), pp. 881\u2013897. SIAM, Philadelphia (2018)","DOI":"10.1137\/1.9781611975031.57"},{"issue":"1","key":"40_CR17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(91)90261-Y","volume":"84","author":"B Chazelle","year":"1991","unstructured":"Chazelle, B., Edelsbrunner, H., Guibas, L.J., Sharir, M.: A singly exponential stratification scheme for real semi-algebraic varieties and its applications. Theor. Comput. Sci. 84(1), 77\u2013105 (1991)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"40_CR18","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jagm.1996.0060","volume":"21","author":"B Chazelle","year":"1996","unstructured":"Chazelle, B., Matou\u0161ek, J.: On linear-time deterministic algorithms for optimization problems in fixed dimension. J. Algorithms 21(3), 579\u2013597 (1996)","journal-title":"J. Algorithms"},{"key":"40_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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 decomposition. In: Brakhage, H. (ed.) Automata Theory and Formal Languages. Lecture Notes in Computer Science, vol. 33, pp. 134\u2013183. Springer, Berlin (1975)"},{"key":"40_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35651-8","volume-title":"Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra","author":"D Cox","year":"2007","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. Undergraduate Texts in Mathematics. Springer, New York (2007)"},{"issue":"1\u20132","key":"40_CR21","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0747-7171(88)80004-X","volume":"5","author":"JH Davenport","year":"1988","unstructured":"Davenport, J.H., Heintz, J.: Real quantifier elimination is doubly exponential. J. Symb. Comput. 5(1\u20132), 29\u201335 (1988)","journal-title":"J. Symb. Comput."},{"issue":"2","key":"40_CR22","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0304-3975(92)90319-B","volume":"92","author":"H Edelsbrunner","year":"1992","unstructured":"Edelsbrunner, H., Guibas, L., Pach, J., Pollack, R., Seidel, R., Sharir, M.: Arrangements of curves in the plane\u2013topology, combinatorics and algorithms. Theor. Comput. Sci. 92(2), 319\u2013336 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"40_CR23","unstructured":"Elekes, G., R\u00f3nyai, L.: A combinatorial problem on polynomials and rational functions. J. Comb. Theory, Ser. A 89(1), 1\u201320 (2000)"},{"issue":"5","key":"40_CR24","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s00493-012-2505-6","volume":"32","author":"G Elekes","year":"2012","unstructured":"Elekes, G., Szab\u00f3, E.: How to find groups? (and how to use them in Erd\u0151s geometry?). Combinatorica 32(5), 537\u2013571 (2012)","journal-title":"Combinatorica"},{"issue":"4","key":"40_CR25","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BF02712875","volume":"16","author":"J Erickson","year":"1996","unstructured":"Erickson, J.: New lower bounds for hopcroft\u2019s problem. Discrete Comput. Geom. 16(4), 389\u2013418 (1996)","journal-title":"Discrete Comput. Geom."},{"key":"40_CR26","unstructured":"Erickson, J.: Lower bounds for linear satisfiability problems. Chicago J. Theor. Comput. Sci. 1999, Art. No. 8 (1999)"},{"key":"40_CR27","unstructured":"Ezra, E., Sharir, M.: A nearly quadratic bound for the decision tree complexity of $$k$$-SUM. In: Aronov, B., Katz, M.J. (eds.) Proceedings of the 33rd International Symposium on Computational Geometry (SoCG\u201917). Leibniz International Proceedings in Informatics, vol.\u00a077, pp. 41:1\u201341:15. Schloss Dagstuhl. Leibniz-Zentrum f\u00fcr Informatik, Wadern (2017)"},{"issue":"4","key":"40_CR28","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0304-3975(76)90078-5","volume":"1","author":"ML Fredman","year":"1976","unstructured":"Fredman, M.L.: How good is the information theory bound in sorting? Theor. Comput. Sci. 1(4), 355\u2013361 (1976)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"40_CR29","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/s00453-015-0079-6","volume":"77","author":"A Freund","year":"2017","unstructured":"Freund, A.: Improved subquadratic 3SUM. Algorithmica 77(2), 440\u2013458 (2017)","journal-title":"Algorithmica"},{"issue":"3","key":"40_CR30","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0925-7721(95)00022-2","volume":"5","author":"A Gajentaan","year":"1995","unstructured":"Gajentaan, A., Overmars, M.H.: On a class of $${O}(n^2)$$ problems in computational geometry. Comput. Geom. 5(3), 165\u2013185 (1995)","journal-title":"Comput. Geom."},{"key":"40_CR31","unstructured":"Gold, O., Sharir, M.: Improved bounds for 3SUM, $$k$$-SUM, and linear degeneracy. In: Pruhs, K., Sohler,\u00a0C. (eds.) Proceedings of the 25th European Symposium on Algorithms (ESA\u201917). LIPIcs. Leibniz International Proceedings in Informatics, vol.\u00a087, pp. 42:1\u201342:13. Schloss Dagstuhl. Leibniz-Zentrum f\u00fcr Informatik, Wadern (2017)"},{"key":"40_CR32","doi-asserted-by":"crossref","unstructured":"Gr\u00f8nlund, A., Pettie, S.: Threesomes, degenerates, and love triangles. In: Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201914), pp. 621\u2013630. IEEE,, Los Alamitos (2014)","DOI":"10.1109\/FOCS.2014.72"},{"key":"40_CR33","unstructured":"Harris, J.: Algebraic Geometry: A First Course. Graduate Texts in Mathematics, vol. 133. Springer, New York (2013)"},{"key":"40_CR34","doi-asserted-by":"crossref","unstructured":"Hartshorne, R.: Algebraic Geometry. Graduate Texts in Mathematics, vol. 52. Springer, New York (1977)","DOI":"10.1007\/978-1-4757-3849-0"},{"key":"40_CR35","doi-asserted-by":"crossref","unstructured":"Kopelowitz, T., Pettie, S., Porat, E.: Higher lower bounds from the 3SUM conjecture. In: Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201916), pp. 1272\u20131287. SIAM, Philadelphia (2016)","DOI":"10.1137\/1.9781611974331.ch89"},{"issue":"2","key":"40_CR36","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02573972","volume":"10","author":"J Matou\u0161ek","year":"1993","unstructured":"Matou\u0161ek, J.: Range searching with efficient hierarchical cutting. Discrete Comput. Geom. 10(2), 157\u2013182 (1993)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"40_CR37","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/jcss.1995.1018","volume":"50","author":"J Matousek","year":"1995","unstructured":"Matousek, J.: Approximations and optimal geometric divide-an-conquer. J. Comput. Syst. Sci. 50(2), 203\u2013208 (1995)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"40_CR38","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1006\/jagm.1996.0027","volume":"20","author":"J Matou\u0161ek","year":"1996","unstructured":"Matou\u0161ek, J.: Derandomization in computational geometry. J. Algorithms 20(3), 545\u2013580 (1996)","journal-title":"J. Algorithms"},{"issue":"2","key":"40_CR39","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1006\/inco.1993.1057","volume":"106","author":"S Meiser","year":"1993","unstructured":"Meiser, S.: Point location in arrangements of hyperplanes. Inform. Comput. 106(2), 286\u2013303 (1993)","journal-title":"Inform. Comput."},{"key":"40_CR40","doi-asserted-by":"crossref","unstructured":"Meyer auf\u00a0der Heide, F.: A polynomial linear search algorithm for the $$n$$-dimensional knapsack problem. J. ACM 31(3), 668\u2013676 (1984)","DOI":"10.1145\/828.322450"},{"key":"40_CR41","doi-asserted-by":"crossref","unstructured":"Henzinger, M., Krinninger, S., Nanongkai, D., Saranurak, T.: Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In: Proceedings of the 47th ACM Symposium on Theory of Computing (STOC\u201915), pp. 21\u201330. ACM, New York (2015)","DOI":"10.1145\/2746539.2746609"},{"key":"40_CR42","doi-asserted-by":"crossref","unstructured":"Kane, D.M., Lovett, S., Moran, S.: Near-optimal linear decision trees for $$k$$-SUM and related problems. In: Proceedings of the 50th ACM Symposium on Theory of Computing (STOC\u201915), pp. 554\u2013563. ACM, New York (2018)","DOI":"10.1145\/3188745.3188770"},{"key":"40_CR43","doi-asserted-by":"crossref","unstructured":"Mishra, B.: Computational real algebraic geometry. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., pp. 743\u2013764. Discrete Mathematics and its Applications (Boca Raton). Chapman and Hall\/CRC, Boca Raton (2004)","DOI":"10.1201\/9781420035315.ch33"},{"key":"40_CR44","unstructured":"Nassajian Mojarrad, H., Pham, T., Valculescu, C., de Zeeuw, F.: Schwartz\u2013Zippel bounds for two-dimensional products (2016). \n                    arXiv:1507.08181"},{"issue":"1","key":"40_CR45","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1017\/S0963548397003192","volume":"7","author":"J Pach","year":"1998","unstructured":"Pach, J., Sharir, M.: On the number of incidences between points and curves. Combin. Probab. Comput. 7(1), 121\u2013127 (1998)","journal-title":"Combin. Probab. Comput."},{"key":"40_CR46","volume-title":"Combinatorial Geometry and Its Algorithmic Applications: The Alcal\u00e1 Lectures","author":"J Pach","year":"2009","unstructured":"Pach, J., Sharir, M.: Combinatorial Geometry and Its Algorithmic Applications: The Alcal\u00e1 Lectures. Mathematical Surveys and Monographs. American Mathematical Society, Providence (2009)"},{"key":"40_CR47","doi-asserted-by":"crossref","unstructured":"P\u0103tracu, M.: Towards polynomial lower bounds for dynamic problems. In: Proceedings of the 42nd ACM International Symposium on Theory of Computing (STOC\u201910), pp. 603\u2013609. ACM, New York (2010)","DOI":"10.1145\/1806689.1806772"},{"key":"40_CR48","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"FP Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Texts and Monographs in Computer Science. Springer, New York (1985)"},{"issue":"6","key":"40_CR49","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1016\/S0022-0000(72)80034-5","volume":"6","author":"MO Rabin","year":"1972","unstructured":"Rabin, M.O.: Proving simultaneous positivity of linear forms. J. Comput. Syst. Sci. 6(6), 639\u2013650 (1972)","journal-title":"J. Comput. Syst. Sci."},{"key":"40_CR50","unstructured":"Raz, O.E., Sharir, M.: The number of unit-area triangles in the plane: Theme and variations. In: Arge, L., Pach, J. (eds.) Proceedings of the 31st International Symposium on Computational Geometry (SoCG\u201915). LIPIcs. Leibniz International Proceedings in Informatics, vol.\u00a034, pp. 569\u2013583. Schloss Dagstuhl. Leibniz-Zentrum f\u00fcr Informatik, Wadern (2015)"},{"key":"40_CR51","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.comgeo.2016.12.002","volume":"62","author":"OE Raz","year":"2017","unstructured":"Raz, O.E., Sharir, M., Shkredov, I.D.: On the number of unit-area triangles spanned by convex grids in the plane. Comput. Geom. 62, 25\u201333 (2017)","journal-title":"Comput. Geom."},{"key":"40_CR52","doi-asserted-by":"crossref","unstructured":"Raz, O.E., Sharir, M., Solymosi, J.: Polynomials vanishing on grids: The Elekes\u2013R\u00f3nyai problem revisited. In: Proceedings of the 30th Annual Symposium on Computational Geometry (SoCG\u201914), pp. 251\u2013260. ACM, New York (2014)","DOI":"10.1145\/2582112.2582150"},{"issue":"4","key":"40_CR53","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1007\/s00454-015-9734-6","volume":"54","author":"OE Raz","year":"2015","unstructured":"Raz, O.E., Sharir, M., Solymosi, J.: On triple intersections of three families of unit circles. Discrete Comput. Geom. 54(4), 930\u2013953 (2015)","journal-title":"Discrete Comput. Geom."},{"key":"40_CR54","unstructured":"Raz, O.E., Sharir, M., de\u00a0Zeeuw, F.: Polynomials vanishing on cartesian products: The Elekes\u2013Szab\u00f3 theorem revisited. In: Arge, L., Pach, J. (eds.) Proceedings of the 31st International Symposium on Computational Geometry (SoCG\u201915). LIPIcs. Leibniz International Proceedings in Informatics, vol.\u00a034, pp. 522\u2013536. Schloss Dagstuhl. Leibniz-Zentrum f\u00fcr Informatik, Wadern (2015)"},{"issue":"2","key":"40_CR55","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/s11856-018-1728-7","volume":"227","author":"OE Raz","year":"2018","unstructured":"Raz, O.E., Sharir, M., de Zeeuw, F.: The Elekes-Szab\u00f3 Theorem in four dimensions. Isr. J. Math. 227(2), 663\u2013690 (2018)","journal-title":"Isr. J. Math."},{"key":"40_CR56","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1090\/S0002-9947-1974-0349648-2","volume":"197","author":"A Seidenberg","year":"1974","unstructured":"Seidenberg, A.: Constructions in algebra. Trans. Am. Math. Soc. 197, 273\u2013313 (1974)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1","key":"40_CR57","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0196-6774(82)90002-5","volume":"3","author":"JM Steele","year":"1982","unstructured":"Steele, J.M., Yao, A.C.: Lower bounds for algebraic decision trees. J. Algorithms 3(1), 1\u20138 (1982)","journal-title":"J. Algorithms"},{"key":"40_CR58","doi-asserted-by":"crossref","unstructured":"Tarski, A.: A decision method for elementary algebra and geometry. In: Caviness, B.F., Johnson, J.R. (eds.) Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts and Monographs in Symbolic Computation, pp. 24\u201384. Springer, Vienna (1998)","DOI":"10.1007\/978-3-7091-9459-1_3"},{"issue":"4","key":"40_CR59","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1145\/322276.322289","volume":"28","author":"ACC Yao","year":"1981","unstructured":"Yao, A.C.C.: A lower bound to finding convex hulls. J. ACM 28(4), 780\u2013787 (1981)","journal-title":"J. ACM"},{"key":"40_CR60","doi-asserted-by":"crossref","unstructured":"Yun, D.Y.Y.: On square-free decomposition algorithms. In: Proceedings of the 3th ACM Symposium on Symbolic and Algebraic Computation (SYMSACC\u201976) , pp. 26\u201335. ACM New York (1976)","DOI":"10.1145\/800205.806320"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-018-0040-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-018-0040-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-018-0040-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T06:40:05Z","timestamp":1589697605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-018-0040-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,21]]},"references-count":60,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["40"],"URL":"https:\/\/doi.org\/10.1007\/s00454-018-0040-y","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,21]]},"assertion":[{"value":"27 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}