Randomized almost-linear-time solver for hypergraph Laplacian Poisson problems with primal and dual certificates.
Title resolution pending
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
-
Solving Hypergraph Laplacian Systems in Almost-Linear Time
Randomized almost-linear-time solver for hypergraph Laplacian Poisson problems with primal and dual certificates.