Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds’ Algorithm

DOI10.1007/978-3-662-44602-7_11zbMath1417.68281OpenAlexW55853783MaRDI QIDQ3190156

Juraj Wiedermann

Publication date: 15 September 2014

Published in: Advanced Information Systems Engineering (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01402036/file/978-3-662-44602-7_11_Chapter.pdf

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Randomized algorithms (68W20)

Related Items

Unnamed Item, Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model