New deterministic algorithms for Online Orthogonal Vectors match or improve prior space-query tradeoffs and refute a 2017 hardness conjecture, with polynomial-space lower bounds under non-uniform SETH.
On the Possibility of Faster
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Online Orthogonal Vectors Revisited
New deterministic algorithms for Online Orthogonal Vectors match or improve prior space-query tradeoffs and refute a 2017 hardness conjecture, with polynomial-space lower bounds under non-uniform SETH.