k-SUM is complete for the existential fragment of linear integer arithmetic sentences, and 3-SUM is complete for sentences using at most three linear inequalities, unifying many fine-grained reductions.
The fine-grained complexity of multi-dimensional ordering properties
1 Pith paper cite this work, alongside 1 external citations. Polarity classification is still indexing.
1
Pith paper citing it
1
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic
k-SUM is complete for the existential fragment of linear integer arithmetic sentences, and 3-SUM is complete for sentences using at most three linear inequalities, unifying many fine-grained reductions.