Pith. sign in

Title resolution pending

· 2017 · DOI 10.1109/focs.2017.68

1 Pith paper cite this work, alongside 6 external citations. Polarity classification is still indexing.

1 Pith paper citing it
6 external citations · OpenAlex
open at publisher browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DS 1

years

2026 1

verdicts

CONDITIONAL 1

representative citing papers

The matrix-vector complexity of $Ax=b$

cs.DS · 2026-02-04 · conditional · novelty 7.0

Randomized matrix-vector algorithms need Ω(κ log(1/ε)) products for general linear systems (two-sided) and n products without the transpose, matching CGNE and GMRES.

citing papers explorer

Showing 1 of 1 citing paper.

  • The matrix-vector complexity of $Ax=b$ cs.DS · 2026-02-04 · conditional · none · ref 36

    Randomized matrix-vector algorithms need Ω(κ log(1/ε)) products for general linear systems (two-sided) and n products without the transpose, matching CGNE and GMRES.