Efficiently correcting matrix products

Leszek Gąsieniec, Christos Levcopoulos, Andrzej Lingas

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Scopus citations

Abstract

We study the problem of efficiently correcting an erroneous product of two n×n matrices over a ring. We provide a randomized algorithm for correcting a matrix product with k erroneous entries running in Õ (√ kn2) time and a deterministic Õ(kn2)-time algorithm for this problem (where the notation Õ suppresses polylogarithmic terms in n and k).

Original languageEnglish (US)
Title of host publicationAlgorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings
EditorsHee-Kap Ahn, Chan-Su Shin
PublisherSpringer Verlag
Pages53-64
Number of pages12
ISBN (Electronic)9783319130743
DOIs
StatePublished - Jan 1 2014
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8889
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

    Fingerprint

Keywords

  • Correction algorithms
  • Matrix multiplication
  • Matrix product verification
  • Randomized algorithms

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Gąsieniec, L., Levcopoulos, C., & Lingas, A. (2014). Efficiently correcting matrix products. In H-K. Ahn, & C-S. Shin (Eds.), Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings (pp. 53-64). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8889). Springer Verlag. https://doi.org/10.1007/978-3-319-13075-0_5