Square-free algorithms in positive characteristic

Applicable Algebra in Engineering, Communications and Computing

Volumn 7, Issue 1, 1996, Pages 1-14

  Gianni, P ^a   Trager, B ^b  

^a UNIVERSITY OF PISA   (Italy)

^b IBM RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001817932     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01613611     Document Type: Article

References (9)

1. Fröhlich, A., Shepherdson, J. C.: Effective Procedures in Field Theory. Philos. Trans. R. Soc. London, Ser. A248, 407-432 (1956)
2. Lang, S.: Algebra. Reading, MA., Addison-Wesley 1965
3. Mines, R., Richman, F., Ruitenberg, W.: A course in Constructive Algebra. Berlin, Heidelberg, New York: Springer 1988
4. Musser, D. R.: Algorithms for Polynomial Factorization. Ph.D. Thesis, C.S. Department, Univ. of Wisconsin (1971)
5. Richman, F.: Seidenberg's condition P. In: Richman, F. (ed.)Constructive Mathematics. Lecture Notes in Mathematics, Vol. 873. Berlin, Heidelberg, New York: Springer 1980
6. Seidenberg, A.: Construction of the integral closure of a finite integral domain. Rend. Sem. Mat. Fis. Milano. 40, 100-120(1970)
7. Seidenberg, A.: Construction in Algebra. Trans. Am. Math. Soc. 197, 273-313 (1974)
8. Seidenberg, A.: Constructions in a polynomial ring over the ring of integers. Am. J. Math. 100, 685-703 (1978)
9. Yun, D.: On Square-Free Decomposition Algorithms. In: Jenks, R. D. (ed.) Proceedings of 1976 ACM SYMSAC. New York: ACM 1976