Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds’ Algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds’ Algorithm

Jiří Wiedermann
  • Fonction : Auteur
  • PersonId : 994203

Résumé

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.
Fichier principal
Vignette du fichier
978-3-662-44602-7_11_Chapter.pdf (296.65 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01402036 , version 1 (24-11-2016)

Licence

Paternité

Identifiants

Citer

Jiří Wiedermann. Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds’ Algorithm. 8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.123-135, ⟨10.1007/978-3-662-44602-7_11⟩. ⟨hal-01402036⟩
64 Consultations
734 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More