%0 Conference Proceedings
%T Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds’ Algorithm
%+ Czech Academy of Sciences [Prague] (CAS)
%A Wiedermann, Jiří
%Z Part 1: Track A: Algorithms, Complexity and Models of Computation
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 8th IFIP International Conference on Theoretical Computer Science (TCS)
%C Rome, Italy
%Y Josep Diaz
%Y Ivan Lanese
%Y Davide Sangiorgi
%I Springer
%3 Theoretical Computer Science
%V LNCS-8705
%P 123-135
%8 2014-09-01
%D 2014
%R 10.1007/978-3-662-44602-7_11
%Z Computer Science [cs]Conference papers
%X 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(n2logn). 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.
%G English
%Z TC 1
%Z TC 2
%Z WG 2.2
%2 https://inria.hal.science/hal-01402036/document
%2 https://inria.hal.science/hal-01402036/file/978-3-662-44602-7_11_Chapter.pdf
%L hal-01402036
%U https://inria.hal.science/hal-01402036
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC2
%~ IFIP-LNCS-8705
%~ IFIP-TCS
%~ IFIP-WG2-2