Comparación de dos algoritmos para resolver el problema de pertenencia a ideales de Z[x]

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.

Guardado en:

Detalles Bibliográficos
Autores principales:	Cáceres Duque, Luis F., López Gallo, Silvia M.
Formato:	Digital
Lenguaje:	spa
Publicado:	Universidad Antonio Nariño 2023
Materias:	problema de pertenencia, ideales, polinomios con coecientes enteros. membership problem, ideals, polynomials over integers.
Acceso en línea:	https://revistas.uan.edu.co/index.php/espaciomatematico/article/view/1468
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Descripción
Sumario:	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.