Freivalds' algorithm: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

6 June 2014

  • curprev 12:2712:27, 6 June 2014en>Comp.archm 7,841 bytes +9 Same fix as previous edit. "beating the classical deterministic algorithm's bound of O(n^3)" is this true? Meaning the naive one? There are better (non-classical?)

25 February 2014

22 November 2013

9 September 2011