On Multidimensional and Monotone k-SUM
From MaRDI portal
Publication:5111265
DOI10.4230/LIPICS.MFCS.2017.50zbMATH Open1441.68092OpenAlexW2774970984MaRDI QIDQ5111265FDOQ5111265
Authors: Chloe Ching-Yun Hsu, Chris Umans 
Publication date: 26 May 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.MFCS.2017.50
Recommendations
Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15)
Cites Work
- On a class of \(O(n^ 2)\) problems in computational geometry
- Subquadratic algorithms for 3SUM
- 3SUM, 3XOR, triangles
- Towards polynomial lower bounds for dynamic problems
- Title not available (Why is that?)
- Threesomes, degenerates, and love triangles
- Finding, minimizing, and counting weighted subgraphs
- On the possibility of faster \textsc{SAT} algorithms
- Lower bounds for linear degeneracy testing
- Clustered Integer 3SUM via Additive Combinatorics
- On hardness of jumbled indexing
- The Parametrized Complexity of Some Fundamental Problems in Coding Theory
- How hard is it to find (honest) witnesses?
- Higher lower bounds from the 3SUM conjecture
- Improved bounds for 3SUM, \(k\)-SUM, and linear degeneracy
- Exact weight subgraphs and the \(k\)-sum conjecture
- Losing weight by gaining edges
Cited In (5)
- Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum
- Fredman's trick meets dominance product: fine-grained complexity of unweighted APSP, 3SUM counting, and more
- Removing additive structure in 3SUM-based reductions
- Multidimensional Hadamard composition and sums with linear constraints upon summation indices
- Deterministic time-space trade-offs for \(k\)-SUM
This page was built for publication: On Multidimensional and Monotone k-SUM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111265)
