Pith. sign in

All in all, the probability of not recoveringi⋆is at most 2 γ+ 200 α·γ+ 0.01 + 1 25 < 1 4, for a suitable choice ofγ

This suffices to ensure that the recovered index from the decoding procedure associated withC equals i⋆

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

fields

cs.DS 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Robustifying Sparse Matrix Multiplication

cs.DS · 2026-07-01 · unverdicted · novelty 8.0

Black-box reduction turns any T(n, m_in, m_out)-time sparse matrix multiplication algorithm into a robust version approximating the k largest outputs in Õ(T(n, m_in, k)) time.

citing papers explorer

Showing 1 of 1 citing paper.

  • Robustifying Sparse Matrix Multiplication cs.DS · 2026-07-01 · unverdicted · none · ref 9

    Black-box reduction turns any T(n, m_in, m_out)-time sparse matrix multiplication algorithm into a robust version approximating the k largest outputs in Õ(T(n, m_in, k)) time.