Jump to content

Freivalds' algorithm: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

12 August 2023

25 July 2023

17 June 2023

10 November 2022

18 August 2022

15 November 2021

14 July 2021

30 May 2021

27 May 2021

25 May 2021

21 May 2021

24 March 2021

25 January 2021

24 June 2020

14 November 2018

30 September 2018

4 May 2018

25 February 2018

30 November 2017

  • curprev 14:2914:29, 30 November 2017146.95.24.63 talk 7,845 bytes −13 It described the Coppersmith-Windograd algorithm as a "matrix multiplication verification algorithm" when in fact it is a deterministic matrix multiplication algorithm. undo

4 December 2016

7 October 2016

13 March 2016

13 January 2016

11 January 2016

9 January 2016

23 February 2015

16 January 2015

6 June 2014

5 May 2014

26 April 2014

25 February 2014

22 November 2013

13 November 2013

12 July 2013

18 April 2013

  • curprev 23:1523:15, 18 April 201376.102.37.19 talk 7,751 bytes +183 Fixed: This is a probabilistic algorithm, not just a randomized one. One could imagine a randomized algorithm that always outputs the correct value and has high probability of finishing in O(n^2) time. This is not that kind of an algorithm. undo

15 March 2013

20 February 2013

9 January 2013

26 September 2012

25 September 2012

10 September 2012

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)