Talk:Defactoring algorithms

Revision as of 10:09, 4 February 2023 by FloraC (talk | contribs) (Created page with "== Readability and conclusion == This article is way too hard to read than necessary. It looks more like a note rather than an article, with so much development information th...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Readability and conclusion

This article is way too hard to read than necessary. It looks more like a note rather than an article, with so much development information that's better off collected in a dedicated "history" section. The algorithms should be presented much much more concisely.

The algorithms are currently presented in Mathematica, which isn't quite easy to decode. I think it should be presented in math formula or pseudocode.

The conclusion seems pretty subjective. I'm not sure "Hermite decomposition" can be treated as a single operation. It's (perhaps superficially) the case in Mathematica, but not in other programming languages or math in general.

I wonder if the original author(s) of this article will do me a favor to allow me to clean it up. Otherwise I'll have to start anew.

FloraC (talk) 10:09, 4 February 2023 (UTC)

Return to "Defactoring algorithms" page.