article · 2014

Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds' Algorithm.

Cited by 0Abstract and details only

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.

Cite this paper

APA 7

Wiedermann, J. (2014). Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds' Algorithm.

MLA 9

Wiedermann, Jiřı́. “Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds' Algorithm.” 2014, pp. 123–35.

Chicago

Wiedermann, Jiřı́. 2014. “Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds' Algorithm.”

Harvard

Wiedermann, J. (2014) ‘Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds' Algorithm’.

BibTeX

@article{wiedermann2014fast,
  title = {{Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds' Algorithm.}},
  author = {Wiedermann, Jiřı́},
  pages = {123--135},
  year = {2014}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.