A comparison of two algorithms for solving the ideal membership problem for Z[x]
Share
Date
Director(s)
Publisher
Universidad Antonio Nariño
Campus
Faculty
Program
Degree obtained
Document type
COAR type
Citation
Bibliographic Managers
Source
item.page.resume
In this work, we present two algorithms for solving the ideal membershipproblem for Z[x]. The rst algorithm was developed by H.Simmons in [5]. The second algorithm is based on the results presentedby G. Szekeres in [6] about minimal bases for the ideals of apolynomial ring over an integral domain.