On Dec 22, 2012, at 1:02 PM, Jens Axel Søgaard wrote: > According to > https://www.cs.drexel.edu/~wan/publications/thesis.pdf > page 33 Gauss elimation turns onto a O(n^4) algorithm. > (Geddes mentions the same issue in relation to Gaussian > elimination over a general ring).
Off topic question. Are you implementing GE as an instance of the GE over rings? If so, is it possible to formulate Unification and Type Inference for say STLC via your math library? Totally off topic. "No" is a fine answer. _________________________ Racket Developers list: http://lists.racket-lang.org/dev
