Deterministic Õ(n^{ω(σ)}) time algorithm for multi-source reachability in digraphs with n^σ sources, improving prior randomized n^{1+2/3ω(σ)} bound.
SIAM Journal on Computing , title =
2 Pith papers cite this work, alongside 5 external citations. Polarity classification is still indexing.
2
Pith papers citing it
5
external citations · OpenAlex
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Gives an approximation algorithm for satisfiable instances of generalized linear equation CSPs over finite groups that is optimal for certain S, while the predicate remains approximation resistant on almost-satisfiable instances.
citing papers explorer
-
Optimal Inapproximability of Generalized Linear Equations over a Finite Group
Gives an approximation algorithm for satisfiable instances of generalized linear equation CSPs over finite groups that is optimal for certain S, while the predicate remains approximation resistant on almost-satisfiable instances.