Metraipolis › archive › dc_a3155ebd4323

Freivalds' algorithm — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Freivalds%27_algorithm
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-15T19:30:20.998Z
SHA-256 of the archived text
bea5dbffdb62c4841981f816551664f58bfa6252fe4c1896372c59f95c55433e
Stable URL of this page
https://metraipolis.com/documento/dc_a3155ebd4323

How to cite

Freivalds' algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Freivalds%27_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_a3155ebd4323 (Metraipolis archive dc_a3155ebd4323, sha256 bea5dbffdb62c4841981f816551664f58bfa6252fe4c1896372c59f95c55433e)
BibTeX
@misc{dca3155ebd4323,
  title = {Freivalds' algorithm — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Freivalds%27_algorithm},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_a3155ebd4323; sha256 bea5dbffdb62c4841981f816551664f58bfa6252fe4c1896372c59f95c55433e},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Freivalds%27_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Freivalds' algorithm (named after Rūsiņš Mārtiņš Freivalds) is a probabilistic randomized algorithm used to verify matrix multiplication. Given three n × n matrices A {\displaystyle A} , B {\displaystyle B} , and C {\displaystyle C} , a general problem is to verify whether A × B = C {\displaystyle A\times B=C} . A naïve algorithm would compute the product A × B {\displaystyle A\times B} explicitly and compare term by term whether this product equals C {\displaystyle C} . However, the best known matrix multiplication algorithm runs in O ( n 2.372 ) {\displaystyle O(n^{2.372})} time. Freivalds' algorithm utilizes randomization in order to reduce this time bound to O ( n 2 ) {\displaystyle O(n^{2})} with high probability. In O ( k n 2 ) {\displaystyle O(kn^{2})} time the algorithm can verify a matrix product with probability of failure less than 2 − k {\displaystyle 2^{-k}} .

Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; ricerca «algorithm»).
Fonte: Wikipedia in inglese, voce «Freivalds' algorithm» — https://en.wikipedia.org/wiki/Freivalds%27_algorithm
Wikidata Q6522941 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q6522941
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Freivalds%27_algorithm?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1371362986, consultata il 2026-10-15T18:37:30.196Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: f15976b2e341acc23e94cf38a522cc5f83396a0f33f7ff526c329f0efabd48e3