algorithms ........................................... 21 7. Squarefree factorization ...................................... 24 8. Hnsel constructions .......................................... 27 a. Solution of a polynomial equation ......................... 27 b. Linear Hensel construction ................................ 28 c. Quadratic Hensel construction ............................. 30 d. Generalized Hensel construction ............................ 31 9. Corresponding factorizations and refinements of factorizations.37 a. Construction of a corrseponding factorization ............. 37 b. Multisets .................................................. 38 c. Refinements of factorizations .............................. 39 10. Construction of a complete factorization ...................... 42 a. Homomorphisms and sets of representives ................... 42 b. R-factorability ........................................... 45 c. A general factorization algorithm ......................... 45 d. Another application ........................................ 48 Acknowledgment References 1.
No takes yet. Share an insight, caveat, or question.
David R. Musser (1975) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: