Skip to main content
SpringerLink
Log in

Efficiently Correcting Matrix Products

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8889))

Included in the following conference series:

Abstract

We study the problem of efficiently correcting an erroneous product of two \(n\times n\) matrices over a ring. We provide a randomized algorithm for correcting a matrix product with \(k\) erroneous entries running in \(\tilde{O}(\sqrt{k}n^2)\) time and a deterministic \(\tilde{O}(kn^2)\)-time algorithm for this problem (where the notation \(\tilde{O}\) suppresses polylogarithmic terms in \(n\) and \(k\)).

Christos Levcopoulos and Andrzej Lingas: Research supported in part by Swedish Research Council grant 621-2011-6179.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Buhrman, H., Spalek, R.: Quantum Verification of Matrix Products. In: Proc. ACM-SIAM SODA, pp. 880–889 (2006)

    Google Scholar 

  2. Chen, Z.-Z., Kao, M.-Y.: Reducing Randomness via Irrational Numbers. In: Proc. ACM STOC, pp. 200–209 (1997)

    Google Scholar 

  3. Coppersmith, D., Winograd, S.: Matrix Multiplication via Arithmetic Progressions. J. of Symbolic Computation 9, 251–280 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  4. De Bonis, A., Gasieniec, L., Vaccaro, U.: Optimal Two-Stage Algorithms for Group Testing Problems. SIAM Journal on Computing 34(5), 1253–1270 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ding, C., Karlsson, C., Liu, H., Davies, T., Chen, Z.: Matrix Multiplication on GPUs with On-Line Fault Tolerance. In: Proc. of the 9th IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA 2011), Busan, Korea, May 26–28 (2011)

    Google Scholar 

  6. Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and its Applications World Scientific Publishing, NJ (1993)

    Google Scholar 

  7. Freivalds, R.: Probabilistic Machines Can Use Less Running Time. IFIP Congress pp. 839–842 (1977)

    Google Scholar 

  8. Le Gall, F.: Powers of Tensors and Fast Matrix Multiplication. In: Proc. 39th International Symposium on Symbolic and Algebraic Computation, (ISSAC 2014), pp. 296–303 (2014)

    Google Scholar 

  9. Kimbrel, T., Sinha, R.K.: A probabilistic algorithm for verifying matrix products using \(O(n^2)\) time and \(\log _2n+O(1)\) random bits. Information Processing Letters 45, 107–119 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  10. Korec, I., Wiedermann, J.: Deterministic Verification of Integer Matrix Multiplication in Quadratic Time. In: Geffert, V., Preneel, B., Rovan, B., Štuller, J., Tjoa, A.M. (eds.) SOFSEM 2014. LNCS, vol. 8327, pp. 375–382. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  11. McConnell, R.M., Mehlhorn, K., Näher, S., Schweitzer, P.: Certifying algorithms. Computer Science Review 5(2), 119–161 (2011)

    Article  MATH  Google Scholar 

  12. Naor, J., Naor, M.: Small-Bias Probability Spaces: Efficient Constructions and Applications. SIAM J. Comput. 22(4), 838–856 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  13. Strassen, V.: Gaussian elimination is not optimal. Numerische Mathematik 13, 354–356 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  14. Vassilevska Williams, V.: Multiplying matrices faster than Coppersmith-Winograd. In: Proc. ACM STOC, pp. 887–898 (2012)

    Google Scholar 

  15. Vassilevska Williams, V., Williams, R.: Subcubic Equivalences between Path, Matrix and Triangle Problems. In: Proc. IEEE FOCS 2010, pp. 645–654 (2010)

    Google Scholar 

  16. Wu, P., Ding, C., Chen, L., Gao, F., Davies, T., Karlsson, C., Chen, Z.: Fault Tolerant Matrix-Matrix Multiplication: Correcting Soft Errors On-Line. In: Proc. of the 2011 Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems (ScalA) held in conjunction with the 24th IEEE/ACM International Conference on High Performance Computing, Networking, Storage and Analysis (SC 2011) (2011)

    Google Scholar 

  17. Wu, P., Ding, C., Chen, L., Gao, F., Davies, T., Karlsson, C., Chen, Z.: On-Line Soft Error Correction in Matrix-Matrix Multiplication. Journal of Computational Science 4(6), 465–472 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Liverpool, Peach Street, Liverpool, L69 7ZF, UK

    Leszek Gąsieniec

  2. Department of Computer Science, Lund University, 22100, Lund, Sweden

    Christos Levcopoulos & Andrzej Lingas

Authors
  1. Leszek Gąsieniec
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christos Levcopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrzej Lingas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christos Levcopoulos .

Editor information

Editors and Affiliations

  1. Pohang University of Science and Technology, Pohang, Korea, Republic of (South Korea)

    Hee-Kap Ahn

  2. Hankuk University of Foreign Studies, Yongin-si, Korea, Republic of (South Korea)

    Chan-Su Shin

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Gąsieniec, L., Levcopoulos, C., Lingas, A. (2014). Efficiently Correcting Matrix Products. In: Ahn, HK., Shin, CS. (eds) Algorithms and Computation. ISAAC 2014. Lecture Notes in Computer Science(), vol 8889. Springer, Cham. https://doi.org/10.1007/978-3-319-13075-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13075-0_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13074-3

  • Online ISBN: 978-3-319-13075-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation