Subquadratic algorithms for algebraic generalizations of 3SUM

Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    The 3SUM problem asks if an input n-set of real numbers contains a triple whose sum is zero. We consider the 3POL problem, a natural generalization of 3SUM where we replace the sum function by a constant-degree polynomial in three variables. The motivations are threefold. Raz, Sharir, and de Zeeuw gave an O(n11/6) upper bound on the number of solutions of trivariate polynomial equations when the solutions are taken from the cartesian product of three n-sets of real numbers. We give algorithms for the corresponding problem of counting such solutions. Grønlund and Pettie recently designed subquadratic algorithms for 3SUM. We generalize their results to 3POL. Finally, we shed light on the General Position Testing (GPT) problem: "Given n points in the plane, do three of them lie on a line?", a key problem in computational geometry. We prove that there exist bounded-degree algebraic decision trees of depth O(n12/7+ϵ) that solve 3POL, and that 3POL can be solved in O(n2(log log n)3/2/(log n)1/2) time in the real-RAM model. Among the possible applications of those results, we show how to solve GPT in sub-quadratic time when the input points lie on o((log n)1/6/(log log n)1/2) constant-degree polynomial curves. This constitutes the first step towards closing the major open question of whether GPT can be solved in subquadratic time. To obtain these results, we generalize important tools - such as batch range searching and dominance reporting - to a polynomial setting. We expect these new tools to be useful in other applications.

    Original languageEnglish (US)
    Title of host publication33rd International Symposium on Computational Geometry, SoCG 2017
    PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
    Pages131-1315
    Number of pages1185
    Volume77
    ISBN (Electronic)9783959770385
    DOIs
    StatePublished - Jun 1 2017
    Event33rd International Symposium on Computational Geometry, SoCG 2017 - Brisbane, Australia
    Duration: Jul 4 2017Jul 7 2017

    Other

    Other33rd International Symposium on Computational Geometry, SoCG 2017
    CountryAustralia
    CityBrisbane
    Period7/4/177/7/17

    Fingerprint

    Polynomials
    Testing
    Computational geometry
    Random access storage
    Decision trees

    Keywords

    • 3SUM
    • Dominance reporting
    • General position testing
    • Polynomial curves
    • Range searching
    • Subquadratic algorithms

    ASJC Scopus subject areas

    • Software

    Cite this

    Barba, L., Cardinal, J., Iacono, J., Langerman, S., Ooms, A., & Solomon, N. (2017). Subquadratic algorithms for algebraic generalizations of 3SUM. In 33rd International Symposium on Computational Geometry, SoCG 2017 (Vol. 77, pp. 131-1315). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2017.13

    Subquadratic algorithms for algebraic generalizations of 3SUM. / Barba, Luis; Cardinal, Jean; Iacono, John; Langerman, Stefan; Ooms, Aurélien; Solomon, Noam.

    33rd International Symposium on Computational Geometry, SoCG 2017. Vol. 77 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. p. 131-1315.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Barba, L, Cardinal, J, Iacono, J, Langerman, S, Ooms, A & Solomon, N 2017, Subquadratic algorithms for algebraic generalizations of 3SUM. in 33rd International Symposium on Computational Geometry, SoCG 2017. vol. 77, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 131-1315, 33rd International Symposium on Computational Geometry, SoCG 2017, Brisbane, Australia, 7/4/17. https://doi.org/10.4230/LIPIcs.SoCG.2017.13
    Barba L, Cardinal J, Iacono J, Langerman S, Ooms A, Solomon N. Subquadratic algorithms for algebraic generalizations of 3SUM. In 33rd International Symposium on Computational Geometry, SoCG 2017. Vol. 77. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2017. p. 131-1315 https://doi.org/10.4230/LIPIcs.SoCG.2017.13
    Barba, Luis ; Cardinal, Jean ; Iacono, John ; Langerman, Stefan ; Ooms, Aurélien ; Solomon, Noam. / Subquadratic algorithms for algebraic generalizations of 3SUM. 33rd International Symposium on Computational Geometry, SoCG 2017. Vol. 77 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. pp. 131-1315
    @inproceedings{ca0b174eabc4405b90dcf31b54aa5ffa,
    title = "Subquadratic algorithms for algebraic generalizations of 3SUM",
    abstract = "The 3SUM problem asks if an input n-set of real numbers contains a triple whose sum is zero. We consider the 3POL problem, a natural generalization of 3SUM where we replace the sum function by a constant-degree polynomial in three variables. The motivations are threefold. Raz, Sharir, and de Zeeuw gave an O(n11/6) upper bound on the number of solutions of trivariate polynomial equations when the solutions are taken from the cartesian product of three n-sets of real numbers. We give algorithms for the corresponding problem of counting such solutions. Gr{\o}nlund and Pettie recently designed subquadratic algorithms for 3SUM. We generalize their results to 3POL. Finally, we shed light on the General Position Testing (GPT) problem: {"}Given n points in the plane, do three of them lie on a line?{"}, a key problem in computational geometry. We prove that there exist bounded-degree algebraic decision trees of depth O(n12/7+ϵ) that solve 3POL, and that 3POL can be solved in O(n2(log log n)3/2/(log n)1/2) time in the real-RAM model. Among the possible applications of those results, we show how to solve GPT in sub-quadratic time when the input points lie on o((log n)1/6/(log log n)1/2) constant-degree polynomial curves. This constitutes the first step towards closing the major open question of whether GPT can be solved in subquadratic time. To obtain these results, we generalize important tools - such as batch range searching and dominance reporting - to a polynomial setting. We expect these new tools to be useful in other applications.",
    keywords = "3SUM, Dominance reporting, General position testing, Polynomial curves, Range searching, Subquadratic algorithms",
    author = "Luis Barba and Jean Cardinal and John Iacono and Stefan Langerman and Aur{\'e}lien Ooms and Noam Solomon",
    year = "2017",
    month = "6",
    day = "1",
    doi = "10.4230/LIPIcs.SoCG.2017.13",
    language = "English (US)",
    volume = "77",
    pages = "131--1315",
    booktitle = "33rd International Symposium on Computational Geometry, SoCG 2017",
    publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

    }

    TY - GEN

    T1 - Subquadratic algorithms for algebraic generalizations of 3SUM

    AU - Barba, Luis

    AU - Cardinal, Jean

    AU - Iacono, John

    AU - Langerman, Stefan

    AU - Ooms, Aurélien

    AU - Solomon, Noam

    PY - 2017/6/1

    Y1 - 2017/6/1

    N2 - The 3SUM problem asks if an input n-set of real numbers contains a triple whose sum is zero. We consider the 3POL problem, a natural generalization of 3SUM where we replace the sum function by a constant-degree polynomial in three variables. The motivations are threefold. Raz, Sharir, and de Zeeuw gave an O(n11/6) upper bound on the number of solutions of trivariate polynomial equations when the solutions are taken from the cartesian product of three n-sets of real numbers. We give algorithms for the corresponding problem of counting such solutions. Grønlund and Pettie recently designed subquadratic algorithms for 3SUM. We generalize their results to 3POL. Finally, we shed light on the General Position Testing (GPT) problem: "Given n points in the plane, do three of them lie on a line?", a key problem in computational geometry. We prove that there exist bounded-degree algebraic decision trees of depth O(n12/7+ϵ) that solve 3POL, and that 3POL can be solved in O(n2(log log n)3/2/(log n)1/2) time in the real-RAM model. Among the possible applications of those results, we show how to solve GPT in sub-quadratic time when the input points lie on o((log n)1/6/(log log n)1/2) constant-degree polynomial curves. This constitutes the first step towards closing the major open question of whether GPT can be solved in subquadratic time. To obtain these results, we generalize important tools - such as batch range searching and dominance reporting - to a polynomial setting. We expect these new tools to be useful in other applications.

    AB - The 3SUM problem asks if an input n-set of real numbers contains a triple whose sum is zero. We consider the 3POL problem, a natural generalization of 3SUM where we replace the sum function by a constant-degree polynomial in three variables. The motivations are threefold. Raz, Sharir, and de Zeeuw gave an O(n11/6) upper bound on the number of solutions of trivariate polynomial equations when the solutions are taken from the cartesian product of three n-sets of real numbers. We give algorithms for the corresponding problem of counting such solutions. Grønlund and Pettie recently designed subquadratic algorithms for 3SUM. We generalize their results to 3POL. Finally, we shed light on the General Position Testing (GPT) problem: "Given n points in the plane, do three of them lie on a line?", a key problem in computational geometry. We prove that there exist bounded-degree algebraic decision trees of depth O(n12/7+ϵ) that solve 3POL, and that 3POL can be solved in O(n2(log log n)3/2/(log n)1/2) time in the real-RAM model. Among the possible applications of those results, we show how to solve GPT in sub-quadratic time when the input points lie on o((log n)1/6/(log log n)1/2) constant-degree polynomial curves. This constitutes the first step towards closing the major open question of whether GPT can be solved in subquadratic time. To obtain these results, we generalize important tools - such as batch range searching and dominance reporting - to a polynomial setting. We expect these new tools to be useful in other applications.

    KW - 3SUM

    KW - Dominance reporting

    KW - General position testing

    KW - Polynomial curves

    KW - Range searching

    KW - Subquadratic algorithms

    UR - http://www.scopus.com/inward/record.url?scp=85029939658&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85029939658&partnerID=8YFLogxK

    U2 - 10.4230/LIPIcs.SoCG.2017.13

    DO - 10.4230/LIPIcs.SoCG.2017.13

    M3 - Conference contribution

    AN - SCOPUS:85029939658

    VL - 77

    SP - 131

    EP - 1315

    BT - 33rd International Symposium on Computational Geometry, SoCG 2017

    PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

    ER -