Abstract
We design two nondeterministic algorithms for matrix multiplication. Both algorithms are based on derandomization of Freivalds’ algorithm for verification of matrix products. The first algorithm works with real numbers and its time complexity on Real RAMs is O(n 2logn). The second one is of the same complexity, works with integer matrices on a unit cost RAM with numbers whose size is proportional to the size of the largest entry in the underlying matrices. Our algorithms bring new ideas into the design of matrix multiplication algorithms and open new avenues for their further development. The results pose exciting questions concerning the relation of the complexity of deterministic versus nondeterministic algorithms for matrix multiplication, and complexity of integer versus real matrices multiplication.
This research was partially supported by RVO 67985807 and the GA ČR grant No. P202/10/1333.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms, p. 470. Addison-Wesley (1974)
De, A., Kurur, P.P., Saha, C., Saptharishi, R.: Fast Integer Multiplication Using Modular Arithmetic. SIAM J. Comput. 42(2), 685–699 (2013)
Ar, S., Blum, M., Codenotti, B., Gemmel, P.: Checking approximate computations over the reals. In: Proc. 25th ACM STOC, pp. 786–795 (1993)
Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation, p. 452. Spinger (1998)
Borodin, A., Moenck, R.: Fast modular transform. Journal of Computer and System Sciences 8, 366–386 (1974)
Bostan, A., Schost, E.: Polynomial evaluation and interpolation on special sets of points. Journal of Complexity 21(4), 420–446 (2005)
Brassard, G., Bratley, P.: Fundamentals of Algorithmics, 524 pages. Prentice Hall, Englewood Cliffs (1996)
Buhrman, H., Špalek, R.: Quantum verification of matrix products. In: Proceedings of SODA, pp. 880–889 (2006)
Cauchy, A.-L.: Mémoire sur la résolution numérique des équations et sur la théorie de l’élimination. Exercices de mathématiques, 40e et 41e livraisons, dans OC (2), IX, 87–161 (1829)
Freivalds, R.: Probabilistic machines can use less running time. In: Information Processing 1977, Proceedings of the IFIP Congress 1977, pp. 839–842 (1977)
Freivalds, R.: Fast Probabilistic Algorithms. In: Bečvář, J. (ed.) Mathematical Foundations of Computer Science 1979. LNCS, vol. 79, pp. 57–69. Springer, Heidelberg (1979)
Fürer, M.: Faster Integer Multiplication. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13 (2007)
Householder, A.: The Numerical Treatment of a Single Nonlinear Equation. McGraw-Hill, New York (1970)
Kimbrel, T., Sinha, R.K.: A probabilistic algorithm for verifying matrix products using O(n 2) time and log2 n + O(1) random bits. Inf. Process. Lett. 45(2), 107–110 (1993)
Korec, I., Wiedermann, J.: Deterministic verification of integer matrix multiplication in quadratic time. In: Geffert, V., et al. (eds.) SOFSEM 2014. LNCS, vol. 8327, pp. 375–382. Springer, Heidelberg (2014)
Le Gall, F., Nishimura, H.: Quantum Algorithms for Matrix Products over Semirings. In: Ravi, R., Gørtz, I.L. (eds.) SWAT 2014. LNCS, vol. 8503, pp. 331–343. Springer, Heidelberg (2014)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)
Naor, J., Naor, M.: Small-bias probability spaces: efficient constructions and applications. SIAM J. Comput. 22(4), 838–856 (1993)
Pratt, V.: Every prime has a succinct certificate. SIAM Journal on Computing 4, 214–220 (1975)
Preparata, F.P., Sarwate, D.V.: Computational complexity of Fourier transform over finite fields. Math. of Comp. 31(139), 740–751 (1977)
Ramanujan, S.: A Proof of Bertrand’s Postulate. J. Indian Math. Soc. 11, 181–182 (1919)
Raz, R.: On the complexity of matrix product. In: Proc. of the 34th Annual ACM Symposium on Theory of Computing. ACM Press (2002)
Strassen, V.: Gaussian elimination is not optimal. Numer. Math. 13, 354–356 (1969)
Vassilevska Williams, V.: Multiplying matrices faster than Coppersmith-Winograd. In: ACM STOC, pp. 887–898 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 IFIP International Federation for Information Processing
About this paper
Cite this paper
Wiedermann, J. (2014). Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds’ Algorithm. In: Diaz, J., Lanese, I., Sangiorgi, D. (eds) Theoretical Computer Science. TCS 2014. Lecture Notes in Computer Science, vol 8705. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44602-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-44602-7_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44601-0
Online ISBN: 978-3-662-44602-7
eBook Packages: Computer ScienceComputer Science (R0)