{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article10068","name":"On Multidimensional and Monotone k-SUM","abstract":"The well-known k-SUM conjecture is that integer k-SUM requires time Omega(n^{\\ceil{k\/2}-o(1)}). Recent work has studied multidimensional k-SUM in F_p^d, where the best known algorithm takes time \\tilde O(n^{\\ceil{k\/2}}). Bhattacharyya et al. [ICS 2011] proved a min(2^{\\Omega(d)},n^{\\Omega(k)}) lower bound for k-SUM in F_p^d under the Exponential Time Hypothesis. We give a more refined lower bound under the standard k-SUM conjecture: for sufficiently large p, k-SUM in F_p^d requires time Omega(n^{k\/2-o(1)}) if k is even, and Omega(n^{\\ceil{k\/2}-2k(log k)\/(log p)-o(1)}) if k is odd.\r\n\t\r\nFor a special case of the multidimensional problem, bounded monotone d-dimensional 3SUM, Chan and Lewenstein [STOC 2015] gave a surprising \\tilde O(n^{2-2\/(d+13)}) algorithm using additive combinatorics. We show this algorithm is essentially optimal. To be more precise, bounded monotone d-dimensional 3SUM requires time Omega(n^{2-\\frac{4}{d}-o(1)}) under the standard 3SUM conjecture, and time Omega(n^{2-\\frac{2}{d}-o(1)}) under the so-called strong 3SUM conjecture. Thus, even though one might hope to further exploit the structural advantage of monotonicity, no substantial improvements beyond those obtained by Chan and Lewenstein are possible for bounded monotone d-dimensional 3SUM.","keywords":["3SUM","kSUM","monotone 3SUM","strong 3SUM conjecture"],"author":[{"@type":"Person","name":"Hsu, Chloe Ching-Yun","givenName":"Chloe Ching-Yun","familyName":"Hsu"},{"@type":"Person","name":"Umans, Chris","givenName":"Chris","familyName":"Umans"}],"position":50,"pageStart":"50:1","pageEnd":"50:13","dateCreated":"2017-12-01","datePublished":"2017-12-01","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Hsu, Chloe Ching-Yun","givenName":"Chloe Ching-Yun","familyName":"Hsu"},{"@type":"Person","name":"Umans, Chris","givenName":"Chris","familyName":"Umans"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2017.50","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume6286","volumeNumber":83,"name":"42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)","dateCreated":"2017-12-01","datePublished":"2017-12-01","editor":[{"@type":"Person","name":"Larsen, Kim G.","givenName":"Kim G.","familyName":"Larsen"},{"@type":"Person","name":"Bodlaender, Hans L.","givenName":"Hans L.","familyName":"Bodlaender"},{"@type":"Person","name":"Raskin, Jean-Francois","givenName":"Jean-Francois","familyName":"Raskin"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article10068","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6286"}}}