The strong 3SUM-Indexing conjecture is false, shown by reducing the problem to function inversion and applying the Fiat-Naor algorithm.
Conditional lower bounds for space/time tradeoffs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Strong 3SUM-INDEXING Conjecture is False
The strong 3SUM-Indexing conjecture is false, shown by reducing the problem to function inversion and applying the Fiat-Naor algorithm.