Freivalds' algorithm: Difference between revisions
Jump to navigation
Jump to search
Cleaned up the math a bit |
en>Comp.arch m 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?) |
||
Line 1: | Line 1: | ||
The author is | The title of the author is Numbers but it's not the most masucline name out there. Managing individuals is what I do and the wage has been truly satisfying. California is our birth location. To do aerobics is a thing that I'm completely addicted to.<br><br>Here is my web page ... [http://www.Pponline.co.uk/user/miriamlinswkucrd www.Pponline.co.uk] |
Latest revision as of 11:27, 6 June 2014
The title of the author is Numbers but it's not the most masucline name out there. Managing individuals is what I do and the wage has been truly satisfying. California is our birth location. To do aerobics is a thing that I'm completely addicted to.
Here is my web page ... www.Pponline.co.uk