Efficiently Correcting Matrix Products

Leszek Gąsieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

We study the problem of efficiently correcting an erroneous product of two n× n matrices over a ring. Among other things, we provide a randomized algorithm for correcting a matrix product with at most k erroneous entries running in O~ (n2+ kn) time and a deterministic O~ (kn2) -time algorithm for this problem (where the notation O~ suppresses polylogarithmic terms in n and k).

Original languageEnglish (US)
Pages (from-to)428-443
Number of pages16
JournalAlgorithmica
Volume79
Issue number2
DOIs
StatePublished - Oct 1 2017

    Fingerprint

Keywords

  • Matrix multiplication
  • Matrix product correction
  • Matrix product verification
  • Randomized algorithms
  • Time complexity

ASJC Scopus subject areas

  • Computer Science(all)
  • Computer Science Applications
  • Applied Mathematics

Cite this

Gąsieniec, L., Levcopoulos, C., Lingas, A., Pagh, R., & Tokuyama, T. (2017). Efficiently Correcting Matrix Products. Algorithmica, 79(2), 428-443. https://doi.org/10.1007/s00453-016-0202-3