Pith. sign in

Combining this with the previous fact, we obtain the second claimed inequality: ¯v=s 2·v≤s·∥ΠT·x∥2 2≤∥x−s∥2 2

Recall that the valuev computed by the AMS sketch satisfies1 2·∥ΠT·x∥2 2≤v≤2·∥ΠT·x∥2 2 with probability at least0

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 7

    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.