Re: [math-fun] Fast Divisionless Determinant and Characteristic Polynomial of Matrix

RCS pointed out some lecture slides showing that E.Kaltofen+G.Villard 2001-2002 knew my result, plus showed more strongly that you can get determinant without division in O(n^2.698) operations, which is quite impressive. I'm not completely sure, but I think the way they did it (maybe?), is equivalent to the following: basically the same as my approach, except you regard it as a block matrix, i.e. each matrix entry in my approach is really a bXb block, and they choose the blocksize b to optimize the runtime. What I actually want: an actual practical program to find det(matrix) without divisions reasonably efficiently.