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.
State-based accelerations and bidirectional search for bi-objective multi-modal shortest paths
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 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.